A sufficient condition for edge 6-colorable planar graphs with maximum degree 6

DOI10.1016/J.DAM.2022.01.018zbMATH Open1485.05037OpenAlexW4220881176MaRDI QIDQ832998FDOQ832998

Authors Zhengrong Lu, Lingsheng Shi

Publication date 28 March 2022

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2022.01.018

zbMATH Keywords

maximum degreeplanar graphedge coloringchromatic index

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)

Recommendations

• A new sufficient condition for a planar graph of maximum degree six to be class 1
• A sufficient condition for a plane graph with maximum degree 6 to be class 1
• Some sufficient conditions for a planar graph of maximum degree six to be Class 1
• Edge colorings of planar graphs without 6-cycles with three chords
• A note on class one graphs with maximum degree six

Cites work

• scientific article; zbMATH DE number 68344 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 3273761 (Why is no real title available?)
• A note on graphs of class I
• A sufficient condition for a planar graph to be class I
• A sufficient condition for a plane graph with maximum degree 6 to be class 1
• Every planar graph with maximum degree 7 is of class 1
• Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\)
• On Tutte's extension of the four-colour problem
• Planar graphs of maximum degree seven are Class I
• Some sufficient conditions for a planar graph of maximum degree six to be Class 1

Cited in

(11)

• Graphs with maximum degree \(6\) are acyclically \(11\)-colorable
• A sufficient condition for a plane graph with maximum degree 6 to be class 1
• A new sufficient condition for a planar graph of maximum degree six to be class 1
• Total-coloring of sparse graphs with maximum degree 6
• Some sufficient conditions for a planar graph of maximum degree six to be Class 1
• Remarks on planar edge-chromatic critical graphs
• Every planar graph with maximum degree 7 is of class 1
• Edge colorings of planar graphs without 6-cycles with three chords
• Structural properties and edge choosability of planar graphs without 6-cycles
• 19-linear-colorable graphs with maximum degree 6
• Finding \(\Delta(\Sigma)\) for a surface \(\Sigma\) of characteristic \(-4\)

This page was built for publication: A sufficient condition for edge 6-colorable planar graphs with maximum degree 6

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832998)