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

DOI10.1016/j.tcs.2013.11.011zbMath1278.05084OpenAlexW2094963701MaRDI QIDQ385973

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

cycleedge coloringplanar graphmaximum degree

Mathematics Subject Classification ID

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

Related Items (3)

A survey on the cyclic coloring and its relaxations ⋮ Facial rainbow edge-coloring of simple 3-connected plane graphs ⋮ Graph edge coloring: a survey

Cites Work

• Edge coloring of embedded graphs with large girth
• 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
• Every planar graph with maximum degree 7 is of class 1
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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