Edge coloring of planar graphs which any two short cycles are adjacent at most once

DOI10.1016/J.TCS.2013.11.011MaRDI QIDQ385973zbMATH OpenOpenAlexFDO

Authors Wei-Ping Ni, Jian-Liang Wu

Publication date 13 December 2013

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2013.11.011

zbMATH Keywords

cyclemaximum degreeplanar graphedge coloring

Mathematics Subject Classification ID

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

Recommendations

• Edge colorings of planar graphs without adjacent special cycles.
• Edge colorings of planar graphs without 6-cycles with three chords
• Edge colorings of planar graphs without 5-cycles with two chords
• Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable
• Edge coloring of planar graphs without adjacent 7-cycles

Cites work

• scientific article; zbMATH DE number 3654142 (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 planar graph to be of class 1
• Edge coloring of embedded graphs with large girth
• Edge colorings of planar graphs without adjacent special cycles.
• Every planar graph with maximum degree 7 is of class 1
• 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

(8)

• Edge colorings of planar graphs without 5-cycles with two chords
• A survey on the cyclic coloring and its relaxations
• Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable
• Facial rainbow edge-coloring of simple 3-connected plane graphs
• Edge coloring of planar graphs without adjacent 7-cycles
• Some results on edge-colourings of graphs
• Edge colorings of planar graphs without adjacent special cycles.
• Graph edge coloring: a survey

This page was built for publication: Edge coloring of planar graphs which any two short cycles are adjacent at most once

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