n-tuple coloring of planar graphs with large odd girth

DOI10.1007/S003730200007zbMATH Open0995.05053OpenAlexW2067362800MaRDI QIDQ1348656FDOQ1348656

Authors: Cun-Quan Zhang, William F. Klostermeyer 

Publication date: 14 May 2002

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730200007

Recommendations

• A note onn-tuple colourings and circular colourings of planar graphs with large odd girth
• \(k\)-fold \((2k+1)\)-coloring of planar graphs
• \(k\)-fold \( (2k+2)\)-coloring of planar graphs
• \(k\)-fold coloring of planar graphs
• Planar graphs with girth at least 5 are \((3, 4)\)-colorable

zbMATH Keywords

Kneser graphhomomorphismplanar graphodd girth

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (9)

• \(k\)-fold \( (2k+2)\)-coloring of planar graphs
• Homomorphisms from sparse graphs to the Petersen graph
• On the tractability of \(( k , i )\)-coloring
• Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope
• Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs
• Towards the Chen-Raspaud conjecture
• \(k\)-fold coloring of planar graphs
• A note onn-tuple colourings and circular colourings of planar graphs with large odd girth
• \(k\)-fold \((2k+1)\)-coloring of planar graphs

This page was built for publication: \(n\)-tuple coloring of planar graphs with large odd girth

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