Local condition for planar graphs of maximum degree 6 to be total 8-colorable
From MaRDI portal
Publication:636063
DOI10.11650/TWJM/1500406163zbMath1284.05074OpenAlexW4233982451MaRDI QIDQ636063
Publication date: 25 August 2011
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11650/twjm/1500406163
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph theory (05C99)
Related Items (5)
Total coloring of planar graphs without short cycles ⋮ Total colorings-a survey ⋮ Total-coloring of sparse graphs with maximum degree 6 ⋮ Local condition for planar graphs of maximum degree 7 to be 8-totally colorable ⋮ A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
This page was built for publication: Local condition for planar graphs of maximum degree 6 to be total 8-colorable
