\(k\)-fold coloring of planar graphs

DOI10.1007/s11425-010-3083-yzbMath1210.05049OpenAlexW2143932975MaRDI QIDQ625874

Yuehua Bu, Guanfeng Ren

Publication date: 25 February 2011

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-010-3083-y

zbMATH Keywords

planar graph\(k\)-fold coloringthe shortest odd cycle

Mathematics Subject Classification ID

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

Related Items (2)

On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs ⋮ Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Multicoloring and Mycielski construction
• \(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 coloring of planar graphs