8 citations · 22 across the 5 of their papers we have counts for
5 papers
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…
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…
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…
Markov bases of binary graph models of K_4-minor free graphs
Daniel Král', Serguei Norine, Ondrej Pangrác
Markov width of a graph is a graph invariant defined as the maximum degree of a Markov basis element for the corresponding graph model for binary contingency tables. We show that a…
Long cycles in fullerene graphs
D. Král', O. Pangrác, J. -S. Sereni +1
It is conjectured that every fullerene graph is hamiltonian. Jendrol' and Owens proved [J. Math. Chem. 18 (1995), pp. 83--90] that every fullerene graph on n vertices has a cycle o…