Daniel Kral
Cited by
Cited by
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
A theorem about the channel assignment problem
D Král, R Škrekovski
SIAM J. Discr. Math 16, 426-437, 2003
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
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
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
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
Quasirandom permutations are characterized by 4-point densities
D Kral, O Pikhurko
Geometric and Functional Analysis 23 (2), 570-579, 2013
Counting flags in triangle-free digraphs
J Hladký, D Král, S Norin
Combinatorica 37 (1), 49-76, 2017
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
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
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
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
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
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
Rank of divisors on tropical curves
J Hladký, D Králʼ, S Norine
Journal of Combinatorial Theory, Series A 120 (7), 1521-1538, 2013
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
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
A problem of Erdős and Sós on 3-graphs
R Glebov, D Kral, J Volec
Israel Journal of Mathematics 211 (1), 349-366, 2016
Graph labellings with variable weights, a survey
JR Griggs, D Král
Discrete Applied Mathematics 157 (12), 2646-2658, 2009
Coloring powers of chordal graphs
Daniel Král'
SIAM Journal on Discrete Mathematics 18 (3), 451-461, 2004
The system can't perform the operation now. Try again later.
Articles 1–20