k-FOLD (2k + 1)-COLORING OF PLANAR GRAPHS

DOI10.1142/S1793830911001164zbMath1222.05048MaRDI QIDQ3087093

Yudie Wu, Yuehua Bu

Publication date: 2 August 2011

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

planar graphodd girth\(k\)-fold coloring

Mathematics Subject Classification ID

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

Cites Work

• Multicoloring and Mycielski construction
• n-tuple colorings and associated graphs
• \(n\)-tuple coloring of planar graphs with large odd girth
• (2 + ?)-Coloring of planar graphs with large odd-girth

This page was built for publication: k-FOLD (2k + 1)-COLORING OF PLANAR GRAPHS