20 citations · 21 across the 14 of their papers we have counts for
17 papers
On Borodin-Kostochka conjecture for correspondence coloring
Zdeněk Dvořák, Ross J. Kang, David Mikšaník
Borodin and Kostochka in 1977 conjectured that if a graph has maximum degree and its clique number satisfies , then its chromatic number satisfies $…
Characterization of sparse monotone graph classes with bounded domination-to-2-independence ratio
Marthe Bonamy, Zdeněk Dvořák, Lukas Michel +1
We give an exact characterization of monotone graph classes C with bounded average degree that satisfy the following property: The domination number of every graph from C is bounde…
Open problems of the 33rd Workshop on Cycles and Colourings
János Barát, Zdeněk Dvořák, Penny Haxell +6
Since its beginnings, every Cycles and Colourings workshop holds one or two open problem sessions; this document contains the problems (together with notes regarding the current st…
Improved Decomposition Bounds for Partition Polytopes and Odd-Covers
Steffen Borgwardt, Zdeněk Dvořák, Bryce Frederickson +2
The assignments of a set of items into clusters of prescribed sizes can be encoded as the vertices of the partition polytope . W…
On a conjecture concerning 4-coloring of graphs with one crossing
Zdeněk Dvořák, Bernard Lidický, Bojan Mohar
We conjecture that every graph of minimum degree five with no separating triangles and drawn in the plane with one crossing is 4-colorable. In this paper, we use computer enumerati…
Lollipops, dense cycles and chords
Zdeněk Dvořák, Beatriz Martins, Stéphan Thomassé +1
In 1980, Gupta, Kahn and Robertson proved that every graph with minimum degree at least contains a cycle containing at least vertices each having at least $…