An oriented 7-colouring of planar graphs with girth at least 7

zbMath1095.05013MaRDI QIDQ2498114

Oleg V. Borodin, Anna O. Ivanova

Publication date: 24 August 2006

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/52629

zbMATH Keywords

oriented chromatic numberacyclic coloringssparse graphs with large girth

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Homomorphisms and colourings of oriented graphs: an updated survey, An oriented 6-coloring of planar graphs with girth at least 9, Oriented vertex and arc colorings of outerplanar graphs, Homomorphism bounds for oriented planar graphs of given minimum girth, Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs, Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs, List strong linear 2-arboricity of sparse graphs, Oriented colorings of partial 2-trees, Acyclic 3-choosability of sparse graphs with girth at least 7, Oriented cliques and colorings of graphs with low maximum degree, An oriented coloring of planar graphs with girth at least five, On the existence and non-existence of improper homomorphisms of oriented and $2$-edge-coloured graphs to reflexive targets