Daniel Kral
Title
Cited by
Cited by
Year
A theorem about the channel assignment problem
D Král', R Skrekovski
SIAM Journal on Discrete Mathematics 16 (3), 426-437, 2003
170*2003
Complexity of coloring graphs without forbidden induced subgraphs
D Král’, J Kratochvíl, Z Tuza, G Woeginger
Graph-Theoretic Concepts in Computer Science, 254-262, 2001
1672001
On the number of pentagons in triangle-free graphs
H Hatami, J Hladký, D Král, S Norine, A Razborov
arXiv preprint arXiv:1102.1634, 2011
1122011
Deciding first-order properties for sparse graphs
Z Dvořák, D Král, R Thomas
Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on …, 2010
962010
Coloring squares of planar graphs with girth six
Z Dvořák, D Král, P Nejedlý, R Škrekovski
European Journal of Combinatorics 29 (4), 838-849, 2008
882008
Testing first-order properties for subclasses of sparse graphs
Z Dvořák, D Král, R Thomas
Journal of the ACM (JACM) 60 (5), 1-24, 2013
822013
A removal lemma for systems of linear equations over finite fields
D Kráľ, O Serra, L Vena
Israel Journal of Mathematics 187 (1), 193-207, 2012
622012
Fullerene graphs have exponentially many perfect matchings
F Kardoš, D Král’, J Miškuf, JS Sereni
Journal of mathematical chemistry 46 (2), 443-447, 2009
622009
A combinatorial proof of the removal lemma for groups
D Král, O Serra, L Vena
Journal of Combinatorial Theory, Series A 116 (4), 971-978, 2009
622009
Counting flags in triangle-free digraphs
J Hladký, D Král, S Norin
Combinatorica 37 (1), 49-76, 2017
592017
A new lower bound based on Gromov’s method of selecting heavily covered points
D Kráľ, L Mach, JS Sereni
Discrete & Computational Geometry 48 (2), 487-498, 2012
542012
Quasirandom permutations are characterized by 4-point densities
D Kral, O Pikhurko
Geometric and Functional Analysis 23 (2), 570-579, 2013
512013
Exponentially many perfect matchings in cubic graphs
L Esperet, F Kardoš, AD King, D Králʼ, S Norine
Advances in Mathematics 227 (4), 1646-1664, 2011
502011
Coloring powers of chordal graphs
Daniel Král'
SIAM Journal on Discrete Mathematics 18 (3), 451-461, 2004
482004
Non-three-colourable common graphs exist
H Hatami, J Hladký, D Kral, S Norine, A Razborov
Combinatorics, Probability and Computing 21 (05), 734-742, 2012
472012
Steinberg's Conjecture is false
V Cohen-Addad, M Hebdige, D Kral, Z Li, E Salgado
Journal of Combinatorial Theory, Series B 122, 452-456, 2017
422017
Finitely forcible graphons and permutons
R Glebov, A Grzesik, T Klimošová, D Král
Journal of Combinatorial Theory, Series B 110, 112-135, 2015
392015
Rank of divisors on tropical curves
J Hladký, D Králʼ, S Norine
Journal of Combinatorial Theory, Series A 120 (7), 1521-1538, 2013
392013
Brooks’ Theorem via the Alon–Tarsi Theorem
J Hladký, D Kral, U Schauz
Discrete Mathematics 310 (23), 3426-3428, 2010
382010
Graph labellings with variable weights, a survey
JR Griggs, D Král
Discrete Applied Mathematics 157 (12), 2646-2658, 2009
382009
The system can't perform the operation now. Try again later.
Articles 1–20