31 citations · 256 across the 67 of their papers we have counts for
Showing 2012 · math.COShow all
3 papers · 2 filters
math.CO2012★ 8 cited
5-list-coloring planar graphs with distant precolored vertices
Zdenek Dvorak, Bernard Lidicky, Bojan Mohar +1
We answer positively the question of Albertson asking whether every planar graph can be -list-colored even if it contains precolored vertices, as long as they are sufficiently f…
math.CO2012★ 11 cited
A stronger structure theorem for excluded topological minors
Zdenek Dvorak
Grohe and Marx proved that if G does not contain H as a topological minor, then there exist constants g=O(|V(H)|^4), D and t depending only on H such that G is a clique sum of grap…
math.CO2012★ 10 cited
5-choosability of graphs with crossings far apart
Zdenek Dvorak, Bernard Lidicky, Bojan Mohar
We give a new proof of the fact that every planar graph is 5-choosable, and use it to show that every graph drawn in the plane so that the distance between every pair of crossings…