Edge coloring of graphs embedded in a surface of nonnegative characteristic

DOI10.1007/s10255-017-0693-yzbMath1390.05076OpenAlexW3014216709MaRDI QIDQ2401779

Yi Qiao Wang

Publication date: 5 September 2017

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-017-0693-y

zbMATH Keywords

cyclechromatic indexembedded graphclass 1

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Graph edge coloring: a survey

Cites Work

• Unnamed Item
• Planar graphs of maximum degree six without 7-cycles are class one
• Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
• Total coloring of planar graphs of maximum degree eight
• Coloring edges of graphs embedded in a surface of characteristic zero.
• Edge coloring of graphs with small average degrees
• Planar graphs of maximum degree seven are Class I
• A note on graphs of class I
• A sufficient condition for a planar graph to be class I
• 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
• 最大度为6 的平面图为第一类的一个新充分条件
• Every planar graph with maximum degree 7 is of class 1