31 citations · 256 across the 67 of their papers we have counts for
7 papers · 1 filter
Fractional coloring of planar graphs of girth five
Zdeněk Dvořák, Xiaolan Hu
A graph G is (a:b)-colorable if there exists an assignment of b-element subsets of {1,...,a} to vertices of G such that sets assigned to adjacent vertices are disjoint. We first sh…
(3a:a)-list-colorability of embedded graphs of girth at least five
Zdeněk Dvořák, Xiaolan Hu
A graph G is list (b:a)-colorable if for every assignment of lists of size b to vertices of G, there exists a choice of an a-element subset of the list at each vertex such that the…
Single-conflict colouring
Zdeněk Dvořák, Louis Esperet, Ross J. Kang +1
Given a multigraph, suppose that each vertex is given a local assignment of colours to its incident edges. We are interested in whether there is a choice of one local colour pe…
Structure and generation of crossing-critical graphs
Zdeněk Dvořák, Petr Hliněný, Bojan Mohar
We study -crossing-critical graphs, which are the minimal graphs that require at least edge-crossings when drawn in the plane. For there are only two such graphs witho…
Planar graphs without cycles of length 4 or 5 are (11:3)-colorable
Zdeněk Dvořák, Xiaolan Hu
A graph G is (a:b)-colorable if there exists an assignment of b-element subsets of {1,...,a} to vertices of G such that sets assigned to adjacent vertices are disjoint. We show tha…
Irreducible 4-critical triangle-free toroidal graphs
Zdeněk Dvořák, Jakub Pekárek
The theory of Dvorak, Kral, and Thomas (2015) shows that a 4-critical triangle-free graph embedded in the torus has only a bounded number of faces of length greater than 4 and that…