48 citations · 253 across the 49 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011★ 10 cited
Bipartizing fullerenes
Zdenek Dvorak, Bernard Lidicky, Riste Skrekovski
A fullerene graph is a cubic bridgeless planar graph with twelve 5-faces such that all other faces are 6-faces. We show that any fullerene graph on n vertices can be bipartized by…
math.CO2011★ 12 cited
Graphs with two crossings are 5-choosable
Zdeněk Dvořák, Bernard Lidický, Riste Škrekovski
A graph G is k-choosable if G can be properly colored whenever every vertex has a list of at least k available colors. Thomassen's theorem states that every planar graph is 5-choos…