Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Daniel Král
Daniel Král'
2010 – today
- 2013
[j101]Daniel Král', Chun-Hung Liu, Jean-Sébastien Sereni, Peter Whalen, Zelealem B. Yilma: A New Bound for the 2/3 Conjecture. Combinatorics, Probability & Computing 22(3): 384-393 (2013)
[j100]Daniel Král', Oriol Serra, Lluís Vena: On the removal lemma for linear systems over Abelian groups. Eur. J. Comb. 34(2): 248-259 (2013)
[j99]Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov: On the number of pentagons in triangle-free graphs. J. Comb. Theory, Ser. A 120(3): 722-732 (2013)
[j98]Jan Hladký, Daniel Král', Serguei Norine: Rank of divisors on tropical curves. J. Comb. Theory, Ser. A 120(7): 1521-1538 (2013)
[c24]Ken-ichi Kawarabayashi, Daniel Král', Marek Krcál, Stephan Kreutzer: Packing directed cycles through a specified vertex set. SODA 2013: 365-377
[i12]Zdenek Dvorak, Daniel Král, Robin Thomas: Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk. CoRR abs/1302.2158 (2013)
[i11]Robert Ganian, Petr Hlinený, Daniel Král, Jan Obdrzálek, Jarett Schwartz, Jakub Teska: FO Model Checking of Interval Graphs. CoRR abs/1302.6043 (2013)- 2012
[j97]Hamed Hatami, Jan Hladký, Daniel Král', Serguei Norine, Alexander A. Razborov: Non-Three-Colourable Common Graphs Exist. Combinatorics, Probability & Computing 21(5): 734-742 (2012)
[j96]
[j95]Daniel Král', Lukás Mach, Jean-Sébastien Sereni: A New Lower Bound Based on Gromov's Method of Selecting Heavily Covered Points. Discrete & Computational Geometry 48(2): 487-498 (2012)
[j94]Jernej Azarija, Rok Erman, Daniel Král', Matjaz Krnc, Ladislav Stacho: Cyclic colorings of plane graphs with independent faces. Eur. J. Comb. 33(3): 294-301 (2012)
[j93]Zdenek Dvorak, Daniel Král': Classes of graphs with small rank decompositions are X-bounded. Eur. J. Comb. 33(4): 679-683 (2012)
[j92]Louis Esperet, Frantisek Kardos, Daniel Král': A superlinear bound on the number of perfect matchings in cubic bridgeless graphs. Eur. J. Comb. 33(5): 767-798 (2012)
[j91]Daniel Král', Bojan Mohar, Atsuhiro Nakamoto, Ondrej Pangrác, Yusuke Suzuki: Coloring Eulerian Triangulations of the Klein Bottle. Graphs and Combinatorics 28(4): 499-530 (2012)
[j90]Daniel Král', Petr Skoda, Jan Volec: Domination number of cubic graphs with large girth. Journal of Graph Theory 69(2): 131-142 (2012)
[j89]Frantisek Kardos, Daniel Král', Jan Volec: Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs. Random Struct. Algorithms 41(4): 506-520 (2012)
[j88]Daniel Král', Matjaz Krnc, Martin Kupec, Borut Luzar, Jan Volec: Extending Fractional Precolorings. SIAM J. Discrete Math. 26(2): 647-660 (2012)
[j87]Daniel Král', Jean-Sébastien Sereni, Ladislav Stacho: Min-Max Relations for Odd Cycles in Planar Graphs. SIAM J. Discrete Math. 26(3): 884-895 (2012)
[c23]Tomás Gavenciak, Daniel Král, Sang-il Oum: Deciding First Order Properties of Matroids. ICALP (2) 2012: 239-250
[i10]Daniel Král', Chun-Hung Liu, Jean-Sébastien Sereni, Peter Whalen, Zelealem B. Yilma: A new bound for the 2/3 conjecture. CoRR abs/1204.2519 (2012)
[i9]Tereza Klimosova, Daniel Král: Hereditary properties of permutations are strongly testable. CoRR abs/1208.2624 (2012)- 2011
[j86]Tomás Kaiser, Andrew King, Daniel Král': Fractional total colourings of graphs of high girth. J. Comb. Theory, Ser. B 101(6): 383-402 (2011)
[j85]Pavel Klavík, Daniel Král', Lukás Mach: Triangles in arrangements of points and lines in the plane. J. Comb. Theory, Ser. A 118(3): 1140-1142 (2011)
[j84]Manuel Bodirsky, Daniel Král': Limit Behavior of Locally Consistent Constraint Satisfaction Problems. SIAM J. Discrete Math. 25(2): 916-933 (2011)
[j83]Frantisek Kardos, Daniel Král', Jan Volec: Fractional colorings of cubic graphs with large girth. SIAM J. Discrete Math. 25(3): 1454-1476 (2011)
[i8]Tomás Gavenciak, Daniel Král, Sang-il Oum: Deciding first order logic properties of matroids. CoRR abs/1108.5457 (2011)
[i7]Zdenek Dvorak, Daniel Král, Robin Thomas: Testing first-order properties for subclasses of sparse graphs. CoRR abs/1109.5036 (2011)- 2010
[j82]Zdenek Dvorak, Jan Kára, Daniel Král', Ondrej Pangrác: Pattern Hypergraphs. Electr. J. Comb. 17(1) (2010)
[j81]Zdenek Dvorak, Daniel Král', Jakub Teska: Toughness threshold for the existence of 2-walks in K4-minor-free graphs. Discrete Mathematics 310(3): 642-651 (2010)
[j80]Jan Hladký, Daniel Král', Uwe Schauz: Brooks' Theorem via the Alon-Tarsi Theorem. Discrete Mathematics 310(23): 3426-3428 (2010)
[j79]Zdenek Dvorak, Tomás Kaiser, Daniel Král', Jean-Sébastien Sereni: A note on antisymmetric flows in graphs. Eur. J. Comb. 31(1): 320-324 (2010)
[j78]Frédéric Havet, Daniel Král', Jean-Sébastien Sereni, Riste Skrekovski: Facial colorings using Hall's Theorem. Eur. J. Comb. 31(3): 1001-1019 (2010)
[j77]Louis Esperet, Daniel Král', Petr Skoda, Riste Skrekovski: An improved linear bound on the number of perfect matchings in cubic graphs. Eur. J. Comb. 31(5): 1316-1334 (2010)
[j76]Daniel Král', Edita Mácajová, Ján Mazák, Jean-Sébastien Sereni: Circular edge-colorings of cubic graphs with girth six. J. Comb. Theory, Ser. B 100(4): 351-358 (2010)
[j75]Alexandr V. Kostochka, Daniel Král', Jean-Sébastien Sereni, Michael Stiebitz: Graphs with bounded tree-width and large odd-girth are almost bipartite. J. Comb. Theory, Ser. B 100(6): 554-559 (2010)
[j74]Daniel Král', Serguei Norine, Ondrej Pangrác: Markov bases of binary graph models of K4-minor free graphs. J. Comb. Theory, Ser. A 117(6): 759-765 (2010)
[j73]Zdenek Dvorak, Daniel Král', Riste Skrekovski: Non-rainbow colorings of 3-, 4- and 5-connected plane graphs. Journal of Graph Theory 63(2): 129-145 (2010)
[j72]Daniel Král', Ladislav Stacho: Coloring plane graphs with independent crossings. Journal of Graph Theory 64(3): 184-205 (2010)
[j71]Tomás Kaiser, Daniel Král', Bernard Lidický, Pavel Nejedlý, Robert Sámal: Short Cycle Covers of Graphs with Minimum Degree Three. SIAM J. Discrete Math. 24(1): 330-355 (2010)
[j70]Frantisek Kardos, Daniel Král', Jean-Sébastien Sereni: The Last Fraction of a Fractional Conjecture. SIAM J. Discrete Math. 24(2): 699-707 (2010)
[c22]Zdenek Dvorak, Daniel Král, Robin Thomas: Deciding First-Order Properties for Sparse Graphs. FOCS 2010: 133-142
[c21]
[i6]Zdenek Dvorak, Daniel Král, Robin Thomas: Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle. CoRR abs/1010.2472 (2010)
2000 – 2009
- 2009
[j69]Veselin Jungic, Tomás Kaiser, Daniel Král': A Note on Edge-Colourings Avoiding Rainbow K4 and Monochromatic Km. Electr. J. Comb. 16(1) (2009)
[j68]Daniel Král', Douglas B. West: Chromatic Number for a Generalization of Cartesian Product Graphs. Electr. J. Comb. 16(1) (2009)
[j67]Zdenek Dvorak, Daniel Král, Pavel Nejedlý, Riste Skrekovski: Distance constrained labelings of planar graphs with no short cycles. Discrete Applied Mathematics 157(12): 2634-2645 (2009)
[j66]Jerrold R. Griggs, Daniel Král: Graph labellings with variable weights, a survey. Discrete Applied Mathematics 157(12): 2646-2658 (2009)
[j65]Daniel Král, Pavel Nejedlý: Distance constrained labelings of K4-minor free graphs. Discrete Mathematics 309(18): 5745-5756 (2009)
[j64]Daniel Král, Edita Mácajová, Ondrej Pangrác, André Raspaud, Jean-Sébastien Sereni, Martin Skoviera: Projective, affine, and abelian colorings of cubic graphs. Eur. J. Comb. 30(1): 53-69 (2009)
[j63]Louis Esperet, Frantisek Kardos, Daniel Král: Cubic bridgeless graphs have more than a linear number of perfect matchings. Electronic Notes in Discrete Mathematics 34: 411-415 (2009)
[j62]Daniel Král, Edita Mácajová, Ján Mazák, Jean-Sébastien Sereni: Circular edge-colorings of cubic graphs with girth six. Electronic Notes in Discrete Mathematics 34: 525-529 (2009)
[j61]Jan Hladký, Daniel Král, Sergey Norin: Counting flags in triangle-free digraphs. Electronic Notes in Discrete Mathematics 34: 621-625 (2009)
[j60]Daniel Král, Oriol Serra, Lluís Vena: A combinatorial proof of the Removal Lemma for Groups. J. Comb. Theory, Ser. A 116(4): 971-978 (2009)
[j59]Daniel Král: Polynomial-Size Binary Decision Diagrams for the Exactly Half-d-Hyperclique Problem Reading Each Input Bit Twice. Theory Comput. Syst. 45(1): 27-42 (2009)
[j58]Zdenek Dvorak, Stanislav Jendrol, Daniel Král, Gyula Pap: Matchings and Nonrainbow Colorings. SIAM J. Discrete Math. 23(1): 344-348 (2009)
[j57]Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický: 6-Critical Graphs on the Klein Bottle. SIAM J. Discrete Math. 23(1): 372-383 (2009)
[j56]Rok Erman, Suzana Jurecic, Daniel Král, Kris Stopar, Nik Stopar: Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs. SIAM J. Discrete Math. 23(3): 1372-1381 (2009)
[j55]Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz: A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs. SIAM J. Discrete Math. 23(3): 1465-1483 (2009)
[c20]Zdenek Dvorak, Daniel Král, Robin Thomas: Coloring triangle-free graphs on surfaces. SODA 2009: 120-129
[c19]
[i5]- 2008
[j54]Daniel Král, Robin Thomas: Coloring even-faced graphs in the torus and the Klein bottle. Combinatorica 28(3): 325-341 (2008)
[j53]Daniel Král, Jiri Sgall, Tomás Tichý: Randomized strategies for the plurality problem. Discrete Applied Mathematics 156(17): 3305-3311 (2008)
[j52]Zdenek Dvorak, Daniel Král, Pavel Nejedlý, Riste Skrekovski: Coloring squares of planar graphs with girth six. Eur. J. Comb. 29(4): 838-849 (2008)
[j51]Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger, Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický: Six-Critical Graphs on the Klein Bottle. Electronic Notes in Discrete Mathematics 31: 235-240 (2008)
[j50]Daniel Král, Ladislav Stacho: Hamiltonian threshold for strong products of graphs. Journal of Graph Theory 58(4): 314-328 (2008)
[j49]Jan Hladký, Daniel Král, Jean-Sébastien Sereni, Michael Stiebitz: List colorings with measurable sets. Journal of Graph Theory 59(3): 229-238 (2008)
[j48]Daniel Král, Matej Stehlík: Coloring of Triangle-Free Graphs on the Double Torus. SIAM J. Discrete Math. 22(2): 541-553 (2008)
[j47]Daniel Král, Petr Skoda: Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice. SIAM J. Discrete Math. 22(4): 1559-1569 (2008)- 2007
[j46]Daniel Král: Mixed hypergraphs and other coloring problems. Discrete Mathematics 307(7-8): 923-938 (2007)
[j45]Daniel Král, Tomás Madaras, Riste Skrekovski: Cyclic, diagonal and facial colorings - a missing case. Eur. J. Comb. 28(6): 1637-1639 (2007)
[j44]Peter Bella, Daniel Král, Bojan Mohar, Katarína Quittnerová: Labeling planar graphs with a condition at distance two. Eur. J. Comb. 28(8): 2201-2239 (2007)
[j43]Daniel Král, Pavel Nejedlý: Distance Constrained Labelings of K4-minor Free Graphs. Electronic Notes in Discrete Mathematics 28: 549-556 (2007)
[j42]Daniel Král, Edita Mácajová, Attila Pór, Jean-Sébastien Sereni: Characterization of affine Steiner triple systems and Hall triple systems. Electronic Notes in Discrete Mathematics 29: 17-21 (2007)
[j41]Daniel Král, Edita Mácajová, Attila Pór, Jean-Sébastien Sereni: Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems. Electronic Notes in Discrete Mathematics 29: 23-27 (2007)
[j40]Tomás Kaiser, Daniel Král, Riste Skrekovski, Xuding Zhu: The circular chromatic index of graphs of high girth. J. Comb. Theory, Ser. B 97(1): 1-13 (2007)
[j39]Daniel Král, Ladislav Stacho: Closure for the property of having a hamiltonian prism. Journal of Graph Theory 54(3): 209-220 (2007)
[j38]Tomás Kaiser, Daniel Král, Ladislav Stacho: Tough spiders. Journal of Graph Theory 56(1): 23-40 (2007)
[j37]Tomás Kaiser, Zdenek Ryjácek, Daniel Král, Moshe Rosenfeld, Heinz-Jürgen Voss: Hamilton cycles in prisms. Journal of Graph Theory 56(4): 249-269 (2007)
[j36]Zdenek Dvorak, Vít Jelínek, Daniel Král, Jan Kyncl, Michael E. Saks: Probabilistic strategies for the partition and plurality problems. Random Struct. Algorithms 30(1-2): 63-77 (2007)
[j35]Robert Babilon, Vít Jelínek, Daniel Král, Pavel Valtr: Labelings of Graphs with Fixed and Variable Edge-Weights. SIAM J. Discrete Math. 21(3): 688-706 (2007)
[c18]Zdenek Dvorak, Daniel Král, Robin Thomas: Coloring Triangle-Free Graphs on Surfaces. ISAAC 2007: 2-4
[c17]- 2006
[j34]Jan Kára, Daniel Král: Free binary decision diagrams for the computation of EARn. Computational Complexity 15(1): 40-61 (2006)
[j33]Veselin Jungic, Daniel Král, Riste Skrekovski: Colorings Of Plane Graphs With No Rainbow Faces. Combinatorica 26(2): 169-182 (2006)
[j32]Mohammad Ghebleh, Daniel Král, Serguei Norine, Robin Thomas: The Circular Chromatic Index of Flower Snarks. Electr. J. Comb. 13(1) (2006)
[j31]Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss: Coloring mixed hypertrees. Discrete Applied Mathematics 154(4): 660-672 (2006)
[j30]Mieczyslaw Borowiecki, Stanislav Jendrol, Daniel Král, Jozef Miskuf: List coloring of Cartesian products of graphs. Discrete Mathematics 306(16): 1955-1958 (2006)
[j29]Zdenek Dvorak, Tomás Kaiser, Daniel Král: Eulerian colorings and the bipartizing matchings conjecture of Fleischner. Eur. J. Comb. 27(7): 1088-1101 (2006)
[j28]Daniel Král: Extending partial 5-colorings and 6-colorings in planar graphs. J. Comb. Theory, Ser. B 96(1): 100-110 (2006)
[j27]Daniel Král, Riste Skrekovski: The last excluded case of Dirac's map-color theorem for choosability. Journal of Graph Theory 51(4): 319-354 (2006)
[j26]Daniel Král, Riste Skrekovski, Martin Tancer: Construction of Large Graphs with No Optimal Surjective L(2, 1)-Labelings. SIAM J. Discrete Math. 20(2): 536-543 (2006)
[j25]Daniel Král: The Channel Assignment Problem with Variable Weights. SIAM J. Discrete Math. 20(3): 690-704 (2006)- 2005
[j24]Daniel Král: An exact algorithm for the channel assignment problem. Discrete Applied Mathematics 145(2): 326-331 (2005)
[j23]Zdenek Dvorak, Daniel Král, Riste Skrekovski: Coloring face hypergraphs on surfaces. Eur. J. Comb. 26(1): 95-110 (2005)
[j22]Daniel Král, Tomás Madaras, Riste Skrekovski: Cyclic, diagonal and facial colorings. Eur. J. Comb. 26(3-4): 473-490 (2005)
[j21]Tomás Kaiser, Daniel Král, Serguei Norine: Unions of perfect matchings in cubic graphs. Electronic Notes in Discrete Mathematics 22: 341-345 (2005)
[j20]Daniel Král, Jana Maxová, Robert Sámal, Pavel Podbrdský: Hamilton cycles in strong products of graphs. Journal of Graph Theory 48(4): 299-321 (2005)
[j19]Daniel Král, Jiri Sgall: Coloring graphs from lists with bounded size of their union. Journal of Graph Theory 49(3): 177-186 (2005)
[j18]Daniel Král, Ondrej Pangrác, Heinz-Jürgen Voss: A note on group colorings. Journal of Graph Theory 50(2): 123-129 (2005)
[j17]Jirí Fiala, Daniel Král, Riste Skrekovski: A Brooks-Type Theorem for the Generalized List T-Coloring. SIAM J. Discrete Math. 19(3): 588-609 (2005)
[j16]Zdenek Dvorak, Daniel Král, Ondrej Pangrác: Locally consistent constraint satisfaction problems. Theor. Comput. Sci. 348(2-3): 187-206 (2005)
[j15]
[c16]Daniel Král, Ondrej Pangrác: An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems. MFCS 2005: 603-614
[c15]Tomás Feder, Pavol Hell, Daniel Král, Jiri Sgall: Two algorithms for general list matrix partitions. SODA 2005: 870-876
[c14]Zdenek Dvorak, Vít Jelínek, Daniel Král, Jan Kyncl, Michael E. Saks: Three Optimal Algorithms for Balls of Three Colors. STACS 2005: 206-217
[c13]Manuel Bodirsky, Daniel Král: Locally Consistent Constraint Satisfaction Problems with Binary Constraints. WG 2005: 295-306- 2004
[j14]
[j13]Daniel Král: On maximum face-constrained coloring of plane graphs with no short face cycles. Discrete Mathematics 277(1-3): 301-307 (2004)
[j12]Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss: Mixed hypercacti. Discrete Mathematics 286(1-2): 99-113 (2004)
[j11]
[j10]Daniel Král, Riste Skrekovski: Borodin's conjecture on diagonal coloring is false. Eur. J. Comb. 25(6): 813-816 (2004)
[j9]Daniel Král, Jana Maxová, Pavel Podbrdský, Robert Sámal: Pancyclicity of Strong Products of Graphs. Graphs and Combinatorics 20(1): 91-104 (2004)
[j8]Daniel Král, Heinz-Jürgen Voss: Edge-disjoint odd cycles in planar graphs. J. Comb. Theory, Ser. B 90(1): 107-120 (2004)
[j7]Tomás Kaiser, Daniel Král, Riste Skrekovski: A revival of the girth conjecture. J. Comb. Theory, Ser. B 92(1): 41-53 (2004)
[j6]
[j5]Daniel Král, Vladan Majerech, Jiri Sgall, Tomás Tichý, Gerhard J. Woeginger: It is tough to be a plumber. Theor. Comput. Sci. 303(3): 473-484 (2004)
[c12]Zdenek Dvorak, Daniel Král, Ondrej Pangrác: Locally Consistent Constraint Satisfaction Problems: (Extended Abstract). ICALP 2004: 469-480
[c11]Daniel Král, Pavel Nejedlý: Group Coloring and List Group Coloring Are Pi2P-Complete (Extended Abstract). MFCS 2004: 274-286
[c10]
[c9]Zdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác: An Algorithm for Cyclic Edge Connectivity of Cubic Graphs. SWAT 2004: 236-247
[i4]Zdenek Dvorak, Daniel Král, Ondrej Pangrác: Locally consistent constraint satisfaction problems. Electronic Colloquium on Computational Complexity (ECCC)(051) (2004)- 2003
[j4]
[j3]Daniel Král, Riste Skrekovski: A Theorem about the Channel Assignment Problem. SIAM J. Discrete Math. 16(3): 426-437 (2003)
[j2]Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss: Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs. Theor. Comput. Sci. 295: 263-278 (2003)
[i3]Daniel Král: Locally satisfiable formulas. Electronic Colloquium on Computational Complexity (ECCC)(050) (2003)
[i2]Jan Kára, Daniel Král: Free Binary Decision Diagrams for Computation of EARn. Electronic Colloquium on Computational Complexity (ECCC)(061) (2003)- 2002
[c8]
[c7]Zdenek Dvorak, Jan Kára, Daniel Král, Ondrej Pangrác: Complexity of Pattern Coloring of Cycle Systems. WG 2002: 164-175- 2001
[j1]
[c6]
[c5]Jakub Cerný, Daniel Král, Helena Nyklová, Ondrej Pangrác: On Intersection Graphs of Segments with Prescribed Slopes. Graph Drawing 2001: 261-271
[c4]Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss: Complexity Note on Mixed Hypergraphs. MFCS 2001: 474-486
[c3]Daniel Král, Jan Kratochvíl, Zsolt Tuza, Gerhard J. Woeginger: Complexity of Coloring Graphs without Forbidden Induced Subgraphs. WG 2001: 254-262- 2000
[c2]Daniel Král: Algebraic an Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their Generalization. MFCS 2000: 477-487
[c1]Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss: Coloring Mixed Hypertrees. WG 2000: 279-289
[i1]Daniel Král: Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and their Generalization. Electronic Colloquium on Computational Complexity (ECCC) 7(13) (2000)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-27 22:26 CEST by the dblp team



