Total-coloring of Plane Graphs with Maximum


The central problem of the total-colorings is the total-coloring conjecture, which asserts that every graph of maximum degree Δ admits a (Δ + 2)-total-coloring. Similar to edgecolorings—with Vizing’s edge-coloring conjecture—this bound can be decreased by 1 for plane graphs of higher maximum degree. More precisely, it is known that if Δ ≥ 10, then every… (More)


9 Figures and Tables

Cite this paper

@inproceedings{NINE2008TotalcoloringOP, title={Total-coloring of Plane Graphs with Maximum}, author={DEGREE NINE and Lukasz Kowalik and Riste Skrekovski}, year={2008} }