31 citations · 256 across the 67 of their papers we have counts for
Showing 2009Show all
3 papers · 1 filter
math.CO2009
Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies
Zdenek Dvorak, Daniel Kral, Robin Thomas
We settle a problem of Havel by showing that there exists an absolute constant d such that if G is a planar graph in which every two distinct triangles are at distance at least d,…
math.CO2009★ 31 cited
Spectral radius of finite and infinite planar graphs and of graphs of bounded genus
Zdenek Dvorak, Bojan Mohar
It is well known that the spectral radius of a tree whose maximum degree is cannot exceed . In this paper we derive similar bounds for arbitrary planar graphs and…
math.CO2009★ 3 cited
Chromatic number and complete graph substructures for degree sequences
Zdenek Dvorak, Bojan Mohar
Given a graphic degree sequence , let (respectively , , and ) denote the maximum value of the chromatic number (respectively, the size of the largest cl…