A new sufficient condition for a planar graph of maximum degree six to be class 1

DOI10.1360/012009-736MaRDI QIDQ5017565zbMATH OpenOpenAlexFDO

Authors Yongzhu Chen, Yiqiao Wang, Weifan Wang

Publication date 17 December 2021

Published in SCIENTIA SINICA Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1360/012009-736

zbMATH Keywords

chromatic indexcyclemaximum degreeplanar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Some sufficient conditions for a planar graph of maximum degree six to be Class 1
• A sufficient condition for edge 6-colorable planar graphs with maximum degree 6
• A sufficient condition for a plane graph with maximum degree 6 to be class 1
• Edge colorings of planar graphs without 6-cycles with three chords
• Every planar graph with maximum degree 7 is of class 1

Cited in

(12)

• Edge colorings of planar graphs without 6-cycles with three chords
• A sufficient condition for a plane graph with maximum degree 6 to be class 1
• Planar graphs of maximum degree seven are Class I
• Edge coloring of graphs embedded in a surface of nonnegative characteristic
• Some sufficient conditions for a planar graph of maximum degree six to be Class 1
• A note on class one graphs with maximum degree six
• Face-degree bounds for planar critical graphs
• A sufficient condition for a graph to be class 1
• scientific article; zbMATH DE number 1439502 (Why is no real title available?)
• Every planar graph with maximum degree 7 is of class 1
• A sufficient condition for edge 6-colorable planar graphs with maximum degree 6
• Remarks on planar edge-chromatic critical graphs

This page was built for publication: A new sufficient condition for a planar graph of maximum degree six to be class 1

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