List of publications of Daniel Kráµ

Research papers accepted for publication in refereed international journals

  1. D. Kráµ, J.-S. Sereni, L. Stacho: Min-max relations for odd cycles in planar graphs, to appear in SIAM Journal on Discrete Mathematics.
  2. D. Kráµ, M. Krnc, M. Kupec, B. Luľar, J. Volec: Extending fractional precolorings, to appear in SIAM Journal on Discrete Mathematics.
  3. D. Kráµ, L. Mach, J.-S. Sereni: A new lower bound based on Gromov's method of selecting heavily covered points, to appear in Discrete and Computational Geometry.
  4. H. Hatami, J. Hladký, D. Kráµ, S. Norine, A. Razborov: Non-three-colorable common graphs exist, to appear in Combinatorics, Probability and Computing.
  5. Z. Dvořák, D. Kráµ: Classes of graphs with small rank decompositions are chi-bounded, European Journal of Combinatorics 33 (2012), 679-683.
  6. F. Kardoą, D. Kráµ, J. Volec: Fractional colorings of cubic graphs with large girth, SIAM Journal on Discrete Mathematics 25 (2011), 1454-1476.
  7. D. Kráµ, B. Mohar, A. Nakamoto, O. Pangrác, Y. Suzuki: Coloring Eulerian triangulations of the Klein bottle, to appear in Graphs and Combinatorics.
  8. L. Esperet, F. Kardoą, A. King, D. Kráµ, S. Norine: Exponentially many perfect matchings in cubic graphs, Advances in Mathematics 227 (2011), 1646-1664.
  9. D. Kráµ: Decomposition width of matroids, Discrete Applied Mathematics 160 (2012), 913-923.
  10. L. Esperet, F. Kardoą, D. Kráµ: A superlinear bound on the number of perfect matchings in cubic bridgeless graphs, European Journal of Combinatorics 33 (2012), 767-798.
  11. J. Azarija, R. Erman, D. Kráµ, M. Krnc, L. Stacho: Cyclic colorings of plane graphs with independent faces, European Journal of Combinatorics 33 (2012), 294-301.
  12. P. Klavík, D. Kráµ, L. Mach: Triangles in arrangements of points and lines in the plane (note), Journal of Combinatorial Theory Series A 118 (2011), 1140-1142.
  13. D. Kráµ, P. ©koda, J. Volec: Domination number of cubic graphs with large girth, Journal of Graph Theory 69 (2012), 131-142.
  14. T. Kaiser, A. King, D. Kráµ: Fractional total colourings of graphs of high girth, Journal of Combinatorial Theory Series B 101 (2011), 383-402.
  15. J. Hladký, D. Kráµ, U. Schauz: Brooks' Theorem via Alon-Tarsi Theorem, Discrete Mathematics 310 (2010), 3426-3428.
  16. F. Kardoą, D. Kráµ, J.-S. Sereni: The last fraction of a fractional conjecture, SIAM Journal on Discrete Mathematics 24 (2010), 699-707.
  17. D. Kráµ, O. Serra, L. Vena: A Removal Lemma for systems of linear equations over finite fields, Israel Journal of Mathematics 187 (2012), 193-207.
  18. A. V. Kostochka, D. Kráµ, J.-S. Sereni, M. Stiebitz: Graphs with bounded tree-width and large odd-girth are almost bipartite, Journal of Combinatorial Theory Series B 100 (2010), 554-559.
  19. M. Bodirsky, D. Kráµ: Limit behavior of locally consistent constraint satisfaction problems , SIAM Journal on Discrete Mathematics 25 (2011), 916-933.
  20. T. Kaiser, D. Kráµ, B. Lidický, P. Nejedlý, R. ©ámal: Short cycle covers of cubic graphs and graphs with minimum degree three, SIAM Journal on Discrete Mathematics 24 (2010), 330-355.
  21. Z. Dvořák, J. Kára, D. Kráµ, O. Pangrác: Pattern hypergraphs, Electronic Journal of Combinatorics 17(1) (2010), #R15, 20pp.
  22. L. Esperet, D. Kráµ, P. ©koda, R. ©krekovski: An improved linear bound on the number of perfect matchings in cubic graphs, European Journal of Combinatorics 31 (2010), 1316-1334.
  23. D. Kráµ, L. Stacho: Coloring plane graphs with independent crossings, Journal of Graph Theory 64 (2010), 184-205.
  24. D. Kráµ, S. Norine, O. Pangrác: Markov bases of binary graph models of K4-minor free graphs, Journal of Combinatorial Theory Series A 117 (2010), 759-765.
  25. D. Kráµ, E. Máčajová, J. Mazák, J.-S. Sereni: Circular edge-colorings of cubic graphs with girth six, Journal of Combinatorial Theory Series B 100 (2010), 351-358.
  26. D. Kráµ, J.-S. Sereni, M. Stiebitz: A new lower bound on the number of perfect matchings in cubic graphs, SIAM Journal on Discrete Mathematics 23 (2009), 1465-1483.
  27. R. Erman, S. Jurecic, D. Kráµ, K. Stopar, N. Stopar: Optimal real number graph labelings of a subfamily of Kneser graphs, SIAM Journal on Discrete Mathematics 23 (2009), 1372-1381.
  28. D. Kráµ, D. B. West: Chromatic number for a generalization of Cartesian product graphs, Electronic Journal of Combinatorics 16(1) (2009), #R71, 9pp.
  29. V. Jungić, T. Kaiser a D. Kráµ: A note on edge-colourings avoiding rainbow K4 and monochromatic Km, Electronic Journal of Combinatorics 16(1) (2009), #N19, 9pp.
  30. Z. Dvořák, T. Kaiser, D. Kráµ, J.-S. Sereni: A note on antisymmetric flows in graphs, European Journal of Combinatorics 31 (2010), 320-324.
  31. B. Grunbaum, T. Kaiser, D. Kráµ, M. Rosenfeld: Equipartite polytopes, Israel Journal of Mathematics 179 (2010), 235-252.
  32. D. Kráµ, O. Serra, L. Vena: A combinatorial proof of the Removal Lemma for groups, Journal of Combinatorial Theory Series A 116 (2009), 971-978.
  33. Z. Dvořák, D. Kráµ, R. ©krekovski: Non-rainbow colorings of 3-, 4- and 5-connected plane graphs, Journal of Graph Theory 63 (2010), 129-145.
  34. F. Havet, D. Kráµ, J.-S. Sereni, R. ©krekovski: Facial colorings using Hall's Theorem, European Journal of Combinatorics 31 (2010), 1001-1019.
  35. F. Kardoą, D. Kráµ, J. Miąkuf, J.-S. Sereni: Fullerene graphs have exponentially many perfect matchings, Journal of Mathematical Chemistry 46 (2009), 443-447.
  36. Z. Dvořák, S. Jendroµ, D. Kráµ, G. Pap: Matchings and non-rainbow colorings, SIAM Journal on Discrete Mathematics 23 (2009), 344-348.
  37. K. Kawarabayashi, D. Kráµ, J. Kynčl, B. Lidický: 6-critical graphs on the Klein bottle, SIAM Journal on Discrete Mathematics 23 (2009), 372-383.
  38. B. Grunbaum, T. Kaiser, D. Kráµ, M. Rosenfeld: Equipartite graphs, Israel Journal of Mathematics 168 (2008), 431-444.
  39. D. Kráµ, P. ©koda: Bounds for the real number graph labellings and application to labellings of the triangular lattice, SIAM Journal on Discrete Mathematics 22 (2008), 1559-1569.
  40. Z. Dvořák, D. Kráµ, P. Nejedlý, R. ©krekovski: Distance constrained labelings of planar graphs with no short cycles, Discrete Applied Mathematics 157 (2009), 2634-2645.
  41. J. Hladký, D. Kráµ, J.-S. Sereni, M. Stiebitz: List colorings with measurable sets, Journal of Graph Theory 59 (2008), 229-238.
  42. D. Kráµ, O. Pangrác, J.-S. Sereni, R. ©krekovski: Long cycles in fullerene graphs, Journal of Mathematical Chemistry 45 (2009), 1021-1031.
  43. D. Kráµ, L. Stacho: Hamiltonian threshold for strong products of graphs, Journal of Graph Theory 58 (2008), 314-328.
  44. D. Kráµ, P. Nejedlý: Distance constrained labelings of K4-minor free graphs, Discrete Mathematics 309 (2009), 5745-5756.
  45. Z. Dvořák, D. Kráµ, J. Teska: Toughness threshold for the existence of 2-walks in K4-minor free graphs, Discrete Mathematics 310 (2010), 642-651.
  46. D. Kráµ, E. Máčajová, A. Pór, J.-S. Sereni: Characterization results for Steiner triple systems and their application to edge-colorings of cubic graphs, Canadian Journal of Mathematics 62 (2010), 355-381.
  47. D. Kráµ, E. Máčajová, O. Pangrác, A. Raspaud, J.-S. Sereni, M. ©koviera: Projective, affine, and abelian colorings of cubic graphs, European Journal on Combinatorics 30 (2009), 53-69.
  48. D. Kráµ, M. Stehlík: Coloring of triangle-free graphs on the double torus, SIAM Journal on Discrete Mathematics 22 (2008), 541-553.
  49. D. Kráµ, R. Thomas: Coloring even-faced graphs in the torus and the Klein bottle, Combinatorica 28 (2008), 325-341.
  50. T. Kaiser, D. Kráµ, M. Rosenfeld, Z. Ryjáček, H.-J. Voss: Hamilton cycles in prisms, Journal of graph theory 56 (2007), 249-269.
  51. R. Babilon, V. Jelínek, D. Kráµ, P. Valtr: Labelings of graphs with fixed and variable edge-weights, SIAM Journal on Discrete Mathematics 21 (2007), 688-706.
  52. T. Kaiser, D. Kráµ, L. Stacho: Tough spiders, Journal of Graph Theory 56 (2007), 23-40.
  53. Z. Dvořák, D. Kráµ, P. Nejedlý, R. ©krekovski: Coloring squares of planar graphs with girth six, European Journal of Combinatorics 29 (2008),838-849.
  54. D. Kráµ, J. Sgall, T. Tichý: Randomized Strategies for the plurality problem, Discrete Applied Mathematics 156 (2008), 3305-3311.
  55. D. Kráµ: Polynomial-size binary decision diagrams for the Exactly half-d-hyperclique problem reading each input bit twice, Theory of Computing Systems 45 (2009), 27-42.
  56. P. Bella, D. Kráµ, B. Mohar, K. Quittnerová: Labeling planar graphs with a condition at distance two, European Journal of Combinatorics 28 (2007), 2201-2239.
  57. D. Kráµ, L. Stacho: Closure for the property of having a hamiltonian prism, Journal of Graph Theory 54 (2006), 209-220.
  58. Z. Dvořák, V. Jelínek, D. Kráµ, J. Kynčl, M. Saks: Probabilistic strategies for the partition and plurality problems, Random Structures and Algorithms 30 (2007), 63-77.
  59. D. Kráµ: Channel assignment problem with variable weights, SIAM Journal on Discrete Mathematics 20 (2006), 690-704.
  60. M. Borowiecki, S. Jendroµ, D. Kráµ, J. Miąkuf: List coloring of Cartesian products of graphs, Discrete Mathematics 306 (2006), 1955-1958.
  61. M. Ghebleh, D. Kráµ, S. Norine, R. Thomas: The circular chromatic index of flower snarks, Electronic Journal of Combinatorics 13(1) (2006), #N20, 7pp.
  62. T. Kaiser, D. Kráµ, R. ©krekovski, X. Zhu: The circular chromatic index of graphs of high girth, Journal of Combinatorial Theory Series B 97 (2007), 1-13.
  63. D. Kráµ, R. ©krekovski, M. Tancer: Construction of large graphs with no optimal surjective L(2,1)-labelings, SIAM Journal on Discrete Mathematics 20 (2006), 536-543.
  64. D. Kráµ, L.-D. Tong, X. Zhu: Upper Hamiltonian Numbers and Hamiltonian Spectra of Graphs, Australasian Journal on Combinatorics 35 (2006), 311-322.
  65. D. Kráµ, R. ©krekovski: The last excluded case of Dirac's Map-Color Theorem for choosability, Journal of Graph Theory 51 (2006), 319-354.
  66. D. Kráµ: Extending partial 5-colorings and 6-colorings in planar graphs, Journal of Combinatorial Theory Series B 96 (2006), 100-110.
  67. Z. Dvořák, D. Kráµ, O. Pangrác: Locally consistent constraint satisfaction problems, Theoretical Computer Science 348 (2005), 187-206.
  68. J. Kára, D. Kráµ: Free Binary Decision Diagrams for Computation of EARn, Computational Complexity 15 (2006), 40-61.
  69. Z. Dvořák, T. Kaiser, D. Kráµ: Eulerian colorings and the Bipartizing matching conjecture of Fleischner, European Journal of Combinatorics 27 (2006), 1088-1101.
  70. D. Kráµ, O. Pangrác, H.-J. Voss: A note on group coloring of planar graphs, Journal of Graph Theory 50 (2005), 123-129.
  71. D. Kráµ: Group coloring is Π2P-complete, Theoretical Computer Science 349 (2005), 99-111.
  72. J. Fiala, D. Kráµ, R. ©krekovski: Brooks-type theorem for the generalized list T-coloring, SIAM Journal on Discrete Mathematics 19 (2005), 588-609.
  73. D. Kráµ: Mixed hypergraphs and other coloring problems, Discrete Mathematics 307 (2007), 923-938.
  74. D. Kráµ, J. Sgall: Coloring graphs from lists with bounded size of their union, Journal of Graph Theory 49 (2005), 177-186.
  75. D. Kráµ, J. Maxová, P. Podbrdský, R. ©ámal: Hamilton cycles in strong products of graphs, Journal of Graph Theory 48 (2005), 299-321.
  76. D. Kráµ: A note on Hajos' theorem for list coloring, Discrete Mathematics 287 (2004), 161-163.
  77. T. Kaiser, D. Kráµ, R. ©krekovski: A revival of the Girth Conjecture, Journal of Combinatorial Theory Series B 92 (2004), 41-53.
  78. D. Kráµ: Coloring powers of chordal graphs, SIAM Journal on Discrete Mathematics 18 (2004), 451-461.
  79. D. Kráµ: On feasible sets of mixed hypergraphs, Electronic Journal of Combinatorics 11(1) (2004), #R19, 14 pages.
  80. D. Kráµ, T. Madaras, R. ©krekovski: Cyclic, diagonal and facial coloring, European Journal of Combinatorics 26 (2005), 473-490.
    D. Kráµ, T. Madaras, R. ©krekovski: Cyclic, diagonal and facial colorings-a missing case, European Journal of Combinatorics 28 (2007), 1637-1639.
  81. Z. Dvořák, D. Kráµ, R. ©krekovski: Coloring face hypergraphs on surfaces, European Journal of Combinatorics 26 (2004), 95-110.
  82. D. Kráµ, J. Kratochvíl, A. Proskurowski, H.-J. Voss: Coloring mixed hypertrees, Discrete Applied Mathematics 154 (2006), 660-672.
  83. V. Jungić, D. Kráµ, R. ©krekovski: Colorings of plane graphs with no rainbow faces, Combinatorica 26 (2006), 169-182.
  84. D. Kráµ: On maximum face-Constrained coloring of plane graphs with no short face cycles, Discrete Mathematics 277 (2004), 301-307.
  85. D. Kráµ, J. Maxová, P. Podbrdský, R. ©ámal: Pancyclicity of strong products of graphs, Graphs and Combinatorics 20 (2004), 91-104.
  86. D. Kráµ, H.-J. Voss: Edge-disjoint odd cycles in planar graphs, Journal of Combinatorial Theory Series B 90 (2004), 107-120.
  87. D. Kráµ, R. ©krekovski: Borodin's Conjecture on diagonal coloring is false, European Journal of Combinatorics 25 (2004), 813-816.
  88. J. Černý, J. Kára, D. Kráµ, P. Podbrdský, R. ©ámal, M. Sotáková: On the number of intersections of polygons, Commentationes Mathematicae Universitatis Carolinae 44 (2003), 217-218.
  89. D. Kráµ, R. ©krekovski: A theorem about the channel assignment problem, SIAM Journal on Discrete Mathematics 16 (2003), 426-437.
  90. D. Kráµ: An exact algorithm for channel assignment problem, Discrete Applied Mathematics 145 (2005), 326-331.
  91. D. Kráµ, J. Kratochvíl, H.-J. Voss: Mixed hypercacti, Discrete Mathematics 286 (2004), 99-113.
  92. D. Kráµ: A counter-example to Voloshin's hypergraph co-perfectness conjecture, Australasian Journal on Combinatorics 27 (2003), 253-262.
  93. D. Kráµ, V. Majerech, J. Sgall, T. Tichý, G. Woeginger: It is tough to be a plumber, Theoretical Computer Science 313 (2004), 473-484.
  94. D. Kráµ, J. Kratochvíl, H.-J. Voss: Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs, Theoretical Computer Science 295 (2003), 263-278.
  95. J. Kára, D. Kráµ: Minimum degree and the number of chords, Ars Combinatoria 68 (2003), 169-179.
  96. Z. Dvořák, D. Kráµ: On planar mixed hypergraphs, Electronic Journal of Combinatorics 8(1) (2001), #R35, 23 pages.

Survey papers

  1. Z. Dvořák, D. Kráµ: Algorithms for classes of graphs with bounded expansion, in Proceedings 35th Workshop on Graph-Theoretic Concepts in Computer Science 2009 (WG'09), Lecture Notes in Computer Science vol. 5911, 2010, pp. 17-32
  2. J. R. Griggs, D. Kráµ: Graph labellings with variable weights, a survey, Discrete Applied Mathematics 157 (2009), 2646-2658.

Research papers in other fully refereed publications

  1. T. Kaiser, D. Kráµ, S. Norine: Unions of perfect matchings in cubic graphs, in "Topics in Discrete Mathematics" (M. Klazar, J. Kratochvíl, J. Matousek, R. Thomas, P. Valtr, eds.), Springer, 2006, 225-230.

Papers accepted to refereed international computer science conferences

  1. T. Gavenčiak, D. Kráµ, S. Oum: Deciding first order properties of matroids, accepted to ICALP'12.
  2. Z. Dvořák, D. Kráµ, R. Thomas: Deciding first-order properties for sparse graphs, Proceedings 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS'10), pp. 133-142, 2010.
  3. D. Kráµ: Decomposition width of matroids, Proceedings 37st International Colloquium Automata, Languages and Programming (ICALP'10), Lecture Notes in Computer Science vol. 6198, pp. 55-66, Springer-Verlag, 2010.
  4. Z. Dvořák, D. Kráµ, R. Thomas: Coloring triangle-free graphs on surfaces, Proceedings of 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'09), pp. 120-129, ACM&SIAM, 2009.
  5. D. Kráµ: Computing representations of matroids of bounded branch-width, Proceedings 24th International Symposium on Theoretical Aspects of Computer Science (STACS'07), Lecture Notes in Computer Science vol. 4393, pp. 224-235, Springer-Verlag, 2007.
  6. D. Kráµ, O. Pangrác: An asymptotically optimal linear-time algorithm for locally consistent constraint satisfaction problems, Proceedings 30th International Symposium Mathematical Foundations of Computer Science 2005 (MFCS'05), Lecture Notes in Computer Science vol. 3618, pp. 603-614, Springer-Verlag, 2005.
  7. M. Bodirsky, D. Kráµ: Locally consistent constraint satisfaction problems with binary constraints, Proceedings 31th Workshop on Graph-Theoretic Concepts in Computer Science 2005 (WG'05), Lecture Notes in Computer Science vol. 3787, pp. 295-306, Springer-Verlag, 2005.
  8. Z. Dvořák, V. Jelínek, D. Kráµ, J. Kynčl, M. Saks: Three optimal algorithms for balls of three colors, Proceedings of 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS'05), Lecture Notes in Computer Science vol. 3404, pp. 206-217, Springer-Verlag, 2005.
  9. T. Feder, P. Hell, D. Kráµ, J. Sgall: Two algorithms for general list matrix partitions, Proceedings of 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'05), pp. 870-876, ACM&SIAM, 2005.
  10. D. Kráµ, P. Nejedlý: Group coloring and list group coloring are Π2P-complete, Proceedings 29th International Symposium Mathematical Foundations of Computer Science 2004 (MFCS'04), Lecture Notes in Computer Science vol. 3153, pp. 274-287, Springer-Verlag, 2004.
  11. Z. Dvořák, D. Kráµ, O. Pangrác: Locally consistent constraint satisfaction problems, Proceedings 31st International Colloquium Automata, Languages and Programming (ICALP'04), Lecture Notes in Computer Science vol. 3142, pp. 469-480, Springer-Verlag, 2004.
  12. Z. Dvořák, J. Kára, D. Kráµ, O. Pangrác: An algorithm for cyclic edge connectivity of cubic graphs, Proceedings 9th Scandinavian Workshop on Algorithm Theory (SWAT'04), Lecture Notes in Computer Science vol. 3111, pp. 236-247, Springer-Verlag, 2004.
  13. D. Kráµ: Locally satisfiable formulas, Proceedings of 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'04), pp. 323-332, ACM&SIAM, 2004.
  14. J. Kára, D. Kráµ: Optimal free binary decision diagrams for computation of EARn, Proceedings 27th International Symposium Mathematical Foundations of Computer Science 2002 (MFCS'02), Lecture Notes in Computer Science vol. 2420, pp. 411-422, Springer-Verlag, 2002.
  15. Z. Dvořák, J. Kára, D. Kráµ, O. Pangrác: On pattern coloring of cycle systems, Proceedings 28th International Workshop on Graph-Theoretic Concepts (WG'02), Lecture Notes in Computer Science vol. 2573, pp. 164-175, Springer-Verlag, 2002.
  16. J. Černý, D. Kráµ, H. Nyklová, O. Pangrác: On intersection graphs of segments with prescribed slopes, Proceedings 9th International Symposium Graph Drawing 2001 (GD'01), Lecture Notes in Computer Science vol. 2265, pp. 261-271, Springer-Verlag, 2002.
  17. D. Kráµ, J. Kratochvíl, H.-J. Voss: Complexity note on mixed hypergraphs, Proceedings 26th International Symposium Mathematical Foundations of Computer Science 2001 (MFCS'01), Lecture Notes in Computer Science vol. 2136, pp. 474-486, Springer-Verlag, 2001.
  18. D. Kráµ: On complexity of colouring mixed hypertrees, Proceedings 13th International Symposium Fundamentals of Computation Theory 2001, 1st Workshop on Efficient Algorithms (WEA'01), Lecture Notes in Computer Science vol. 2138, pp. 516-524, Springer-Verlag, 2001.
  19. D. Kráµ, J. Kratochvíl, Zs. Tuza, G. Woeginger: Complexity of coloring graphs without forbidden induced subgraphs, Proceedings 27th International Workshop on Graph-Theoretic Concepts in Computer Science 2001 (WG'01), Lecture Notes in Computer Science vol. 2204, pp. 254-262, Springer-Verlag, 2001.
  20. D. Kráµ, J. Kratochvíl, A. Proskurowski, J.-H. Voss: Coloring mixed hypertrees, Proceedings 26th Workshop on Graph-Theoretic Concepts in Computer Science 2000 (WG'00), Lecture Notes in Computer Science vol. 1928, pp. 279-289, Springer-Verlag, 2000.
  21. D. Kráµ: Algebraic and uniqueness properties of parity ordered binary decision diagrams and their generalization, Proceedings 25th Symposium on Mathematical Foundations of Computer Science 2000 (MFCS'00), Lecture Notes in Computer Science vol. 1893, pp. 477-487, Springer-Verlag, 2000.

Contributions at mathematical conferences with published proceedings

  1. D. Kráµ, E. Máčajová, J. Mazák, J.-S. Sereni: Circular edge-colorings of cubic graphs with girth six, proceedings of Eurocomb'09, Electronic Notes in Discrete Mathematics 34 (2009), 525-529.
  2. J. Hladký, D. Kráµ, S. Norin: Counting flags in triangle-free digraphs, proceedings of Eurocomb'09, Electronic Notes in Discrete Mathematics 34 (2009), 621-625.
  3. L. Esperet, F. Kardoą, D. Kráµ: Cubic bridgeless graphs have more than a linear number of perfect matchings, proceedings of Eurocomb'09, Electronic Notes in Discrete Mathematics 34 (2009), 411-415.
  4. N. Chenette, K. Kawarabayashi, D. Kráµ, J. Kynčl, B. Lidický, L. Postle, N. Streib, R. Thomas, C. Yerger: Six-critical graphs on the Klein bottle, proceedings of TGGT'08, Electronic Notes in Discrete Mathematics 31 (2008), 235-240.
  5. D. Kráµ, E. Máčajová, A. Por, J.-S. Sereni: Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems, proceedings of Eurocomb'07, Electronic Notes in Discrete Mathematics 29 (2007), 23-27.
  6. D. Kráµ, E. Máčajová, A. Por, J.-S. Sereni: Characterization of affine Steiner triple systems and Hall triple systems, proceedings of Eurocomb'07, Electronic Notes in Discrete Mathematics 29 (2007), 17-21.
  7. P. Bella, D. Kráµ, B. Mohar, K. Quittnerová: Labeling planar graphs with a condition at distance two, proceedings of Eurocomb'05, Discrete Mathematics and Theoretical Computer Science AE (2005), 41-44.
  8. T. Kaiser, D. Kráµ, S. Norine: Unions of perfect matchings in cubic graphs, proceedings of ICGT'05, Electronic Notes in Discrete Mathematics 22 (2005), 341-345.

Submitted papers

  1. J. Hladký, D. Kráµ, S. Norine: Rank of divisors on tropical curves, available as ITI report 2007-363.
  2. J. Hladký, D. Kráµ, S. Norine: Counting flags in triangle-free digraphs, available as ITI report 2009-459.
  3. Z. Dvořák, K. Kawarabayashi, D. Kráµ: Packing six T-joins in plane graphs, available as ITI report 2010-514.
  4. Z. Dvořák, D. Kráµ, R. Thomas: Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle, available as ITI report 2010-508.
  5. D. Kráµ, O. Serra, L. Vena: On the Removal Lemma for linear systems over Abelian groups, available as ITI report 2010-511.
  6. H. Hatami, J. Hladký, D. Kráµ, S. Norine, A. Razborov: On the number of pentagons in triangle-free graphs, available as arXiv:1102.1634.
  7. F. Kardoą, D. Kráµ, J. Volec: Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs, available as arXiv:1108.6280.
  8. Z. Dvořák, D. Kráµ, R. Thomas: Testing first-order properties for subclasses of sparse graphs, available as arXiv:1109.5036.
  9. D. Ferguson, T. Kaiser, D. Kráµ: The fractional chromatic number of triangle-free subcubic graphs, available as arXiv:1203.1308.
  10. D. Kráµ, C.-H. Liu, J.-S. Sereni, P. Whalen, Z. Yilma: A new bound for the 2/3 conjecture, available as arXiv:1204.2519.
  11. D. Kráµ, O. Pikhurko: Quasirandom permutations are characterized by 4-point densities, available as arXiv:1205.3074.