Article ID Journal Published Year Pages File Type
6875413 Theoretical Computer Science 2018 6 Pages PDF
Abstract
A graph is said to be of class 1 if its edge chromatic number is equal to the maximum degree of this graph. Let G be a planar graph with maximum degree Δ≥6 and without adjacent 7-cycles, then G is of class 1.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Edge coloring of planar graphs without adjacent 7-cycles
Authors
, ,