\(n\)-tuple coloring of planar graphs with large odd girth

DOI10.1007/s003730200007zbMath0995.05053OpenAlexW2067362800MaRDI QIDQ1348656

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

zbMATH Keywords

homomorphismplanar graphKneser graphodd girth

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (8)

\(k\)-fold coloring of planar graphs ⋮ Towards the Chen-Raspaud conjecture ⋮ 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 ⋮ A note onn-tuple colourings and circular colourings of planar graphs with large odd girth ⋮ Homomorphisms from sparse graphs to the Petersen graph ⋮ k-FOLD (2k + 1)-COLORING OF PLANAR GRAPHS

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