Oriented 5-coloring of sparse plane graphs
From MaRDI portal
Publication:3115582
DOI10.1134/S1990478907010024zbMath1249.05112MaRDI QIDQ3115582
Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka
Publication date: 10 February 2012
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
An oriented 6-coloring of planar graphs with girth at least 9, Homomorphism bounds for oriented planar graphs of given minimum girth, Decomposition of sparse graphs into two forests, one having bounded maximum degree, \((k,1)\)-coloring of sparse graphs, List 2-facial 5-colorability of plane graphs with girth at least 12, Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs, Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k, Circular Flows in Planar Graphs, On the existence and non-existence of improper homomorphisms of oriented and $2$-edge-coloured graphs to reflexive targets