k-fold coloring of planar graphs

DOI10.1007/S11425-010-3083-YzbMATH Open1210.05049OpenAlexW2143932975MaRDI QIDQ625874FDOQ625874

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• (2 + ?)-Coloring of planar graphs with large odd-girth
• \(n\)-tuple coloring of planar graphs with large odd girth
• Multicoloring and Mycielski construction

Cited In (10)

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