8 citations · 15 across the 3 of their papers we have counts for
3 papers
math.CO2019★ 7 cited
Flexibility of planar graphs of girth at least six
Zdeněk Dvořák, Tomáš Masařík, Jan Musílek +1
Let G be a planar graph with a list assignment L. Suppose a preferred color is given for some of the vertices. We prove that if G has girth at least six and all lists have size at…
math.CO2019★ 8 cited
Flexibility of triangle-free planar graphs
Zdeněk Dvořák, Tomáš Masařík, Jan Musílek +1
Let G be a planar graph with a list assignment L. Suppose a preferred color is given for some of the vertices. We prove that if G is triangle-free and all lists have size at least…
math.CO2016
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…