k-fold coloring of planar graphs

DOI10.1007/S11425-010-3083-YMaRDI QIDQ625874zbMATH OpenOpenAlexFDO

Authors Guanfeng Ren, Yuehua Bu

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

\(k\)-fold coloringplanar graphthe shortest odd cycle

Mathematics Subject Classification ID

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

Recommendations

• k-fold (2k+1)-coloring of planar graphs
• \(k\)-fold \( (2k+2)\)-coloring of planar graphs
• \(n\)-tuple coloring of planar graphs with large odd girth
• On optimal \(k\)-fold colorings of webs and antiwebs
• Multi-coloring the Mycielskian of graphs

Cites work

• (2 + ?)-Coloring of planar graphs with large odd-girth
• \(n\)-tuple coloring of planar graphs with large odd girth
• scientific article; zbMATH DE number 95245 (Why is no real title available?)
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• Multicoloring and Mycielski construction

Cited in

(10)

• The \(k\)-fold list coloring of cycles with Hall's condition
• \(n\)-tuple coloring of planar graphs with large odd girth
• Channel assignment problem and n-fold t-separated L(j₁,j₂,,j_m)-labeling of graphs
• On optimal \(k\)-fold colorings of webs and antiwebs
• Folding
• k-fold (2k+1)-coloring of planar graphs
• \(k\)-fold \( (2k+2)\)-coloring of planar graphs
• Multi-coloring the Mycielskian of graphs
• On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
• Bounded colorings of outerplanar graphs

This page was built for publication: \(k\)-fold coloring of planar graphs

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