Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles

DOI10.1080/00207160903033648zbMath1214.05026OpenAlexW2084923272MaRDI QIDQ3066941

Bin Liu, Gui Zhen Liu, Ji Hui Wang, Jian-Feng Hou

Publication date: 20 January 2011

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160903033648

zbMATH Keywords

cycleEuler characteristicchromatic indexedge colouringchord

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Coloring edges of graphs embedded in a surface of characteristic zero.
• Edge coloring of embedded graphs with large girth
• Edge coloring of graphs with small average degrees
• Edge colorings of graphs embeddable in a surface of low genus
• Planar graphs of maximum degree seven are 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
• Scheduling File Transfers
• Scheduling File Transfers for Trees and Odd Cycles
• Coloring edges of embedded graphs
• Every planar graph with maximum degree 7 is of class 1