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

DOI10.1080/00207160903033648MaRDI QIDQ3066941zbMATH OpenOpenAlexFDO

Authors Bin Liu, Jianfeng Hou, Guizhen Liu, Jihui Wang

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

Euler characteristiccycleedge colouringchromatic indexchord

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Edge colourings of embedded special graphs
• Edge colorings of embedded special graphs
• Edge colourings of embedded 1-graphs
• Edge coloring of embedded graphs with large girth
• Coloring edges of embedded graphs

Cites work

• A sufficient condition for a planar graph to be class I
• Coloring edges of embedded graphs
• 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
• Every planar graph with maximum degree 7 is of class 1
• Planar graphs of maximum degree seven are Class I
• Scheduling File Transfers
• Scheduling File Transfers for Trees and Odd Cycles
• Some sufficient conditions for a planar graph of maximum degree six to be Class 1

Cited in

(6)

• Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers
• Edge coloring of embedded graphs with large girth
• Edge colorings of embedded special graphs
• Edge colourings of embedded special graphs
• scientific article; zbMATH DE number 1390128 (Why is no real title available?)
• Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles

This page was built for publication: Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles

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