31 citations · 256 across the 67 of their papers we have counts for
3 papers · 2 filters
List coloring with requests
Zdeněk Dvořák, Sergey Norin, Luke Postle
Let G be a graph with a list assignment L. Suppose a preferred color is given for some of the vertices; how many of these preferences can be respected when L-coloring G? We explore…
Triangle-free planar graphs with the smallest independence number
Zdeněk Dvořák, Tomáš Masařík, Jan Musílek +1
Steinberg and Tovey proved that every n-vertex planar triangle-free graph has an independent set of size at least (n+1)/3, and described an infinite class of tight examples. We sho…
Cyclic Coloring of Plane Graphs with Maximum Face Size 16 and 17
Zdenek Dvorak, Michael Hebdige, Filip Hlasek +2
Plummer and Toft conjectured in 1987 that the vertices of every 3-connected plane graph with maximum face size D can be colored using at most D+2 colors in such a way that no face…