Edge coloring of planar graphs without adjacent 7-cycles

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.

Saved in:
Bibliographic Details
Published in:Theoretical computer science 2018-08, Vol.739, p.59-64
Main Authors: Zhang, Wenwen, Wu, Jian-Liang
Format: Article
Language:English
Subjects:
Class 1
Cycle
Edge coloring
Planar graph
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2018.05.006