(2 + ?)-Coloring of planar graphs with large odd-girth
From MaRDI portal
Publication:4946546
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(200002)33:2<109::AID-JGT5>3.0.CO;2-F" /><109::AID-JGT5>3.0.CO;2-F 10.1002/(SICI)1097-0118(200002)33:2<109::AID-JGT5>3.0.CO;2-FzbMath0944.05046OpenAlexW4248657228MaRDI QIDQ4946546
Cun-Quan Zhang, William F. Klostermeyer
Publication date: 24 September 2000
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200002)33:2<109::aid-jgt5>3.0.co;2-f
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (23)
Walk-powers and homomorphism bounds of planar signed graphs ⋮ On the density of \(C_7\)-critical graphs ⋮ Fractional, Circular, and Defective Coloring of Series-Parallel Graphs ⋮ Homomorphisms and edge-colourings of planar graphs ⋮ Graphs with bounded tree-width and large odd-girth are almost bipartite ⋮ Fractional coloring of triangle-free planar graphs ⋮ Graph factors modulo \(k\) ⋮ Fractional coloring planar graphs under Steinberg-type conditions ⋮ On the packing number of antibalanced signed simple planar graphs of negative girth at least 5 ⋮ Mapping planar graphs into the Coxeter graph ⋮ \(k\)-fold coloring of planar graphs ⋮ Density of 5/2-critical graphs ⋮ Homomorphisms from sparse graphs with large girth. ⋮ Homomorphisms of signed graphs: an update ⋮ Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs ⋮ Circular consecutive choosability of k-choosable graphs ⋮ A Complexity Dichotomy for the Coloring of Sparse Graphs ⋮ Circular chromatic number of signed graphs ⋮ k-FOLD (2k + 1)-COLORING OF PLANAR GRAPHS ⋮ Homomorphisms of sparse signed graphs ⋮ Graph imperfection. I ⋮ Mapping Planar Graphs into Projective Cubes ⋮ Circular flows of nearly Eulerian graphs and vertex-splitting
Cites Work
This page was built for publication: (2 + ?)-Coloring of planar graphs with large odd-girth
