14 citations · 14 across the 3 of their papers we have counts for
4 papers
Precoloring extension in planar near-Eulerian-triangulations
Zdeněk Dvořák, Benjamin Moore, Michaela Seifrtová +1
We consider the 4-precoloring extension problem in \emph{planar near-Eulerian-triangulations}, i.e., plane graphs where all faces except possibly for the outer one have length thre…
On weighted sublinear separators
Zdeněk Dvořák
Consider a graph G with an assignment of costs to vertices. Even if G and all its subgraphs admit balanced separators of sublinear size, G may only admit a balanced separator of su…
Exponentially many nowhere-zero -, -, and -flows
Zdeněk Dvořák, Bojan Mohar, Robert Šámal
We prove that, in several settings, a graph has exponentially many nowhere-zero flows. These results may be seen as a counting alternative to the well-known proofs of existence of…
Crossing-critical graphs with large maximum degree
Zdenek Dvorak, Bojan Mohar
A conjecture of Richter and Salazar about graphs that are critical for a fixed crossing number is that they have bounded bandwidth. A weaker well-known conjecture of Richter is…