Article ID Journal Published Year Pages File Type
4648044 Discrete Mathematics 2012 4 Pages PDF
Abstract

Let GG be a planar graph with maximum degree Δ≥7Δ≥7 and without adjacent 4-cycles, that is, two cycles of length 4 do not share one common edge. Then its total chromatic number is Δ+1Δ+1.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
A note on the total coloring of planar graphs without adjacent 4-cycles
Authors
, ,