Circular \((5,2)\)-coloring of sparse graphs
From MaRDI portal
Publication:2454506
zbMath1299.05115MaRDI QIDQ2454506
Oleg V. Borodin, Stephen G. Hartke, Douglas B. West, Anna O. Ivanova, Alexandr V. Kostochka
Publication date: 13 June 2014
Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: http://semr.math.nsc.ru/v5/p417-426.pdf
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (8)
On the odd girth and the circular chromatic number of generalized Petersen graphs ⋮ Decomposition of sparse graphs into two forests, one having bounded maximum degree ⋮ \((k,1)\)-coloring of sparse graphs ⋮ Density of 5/2-critical graphs ⋮ List 2-facial 5-colorability of plane graphs with girth at least 12 ⋮ An introduction to the discharging method via graph coloring ⋮ Homomorphisms from sparse graphs to the Petersen graph ⋮ Circular Flows in Planar Graphs
This page was built for publication: Circular \((5,2)\)-coloring of sparse graphs
