An oriented coloring of planar graphs with girth at least five

DOI10.1016/j.disc.2008.04.030zbMath1198.05069OpenAlexW1964120092MaRDI QIDQ1025464

Alexandre Pinlou

Publication date: 19 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.030

zbMATH Keywords

girthplanar graphoriented chromatic numberoriented coloringmaximum average degreedischarging procedure

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (12)

Homomorphisms and colourings of oriented graphs: an updated survey ⋮ An oriented 6-coloring of planar graphs with girth at least 9 ⋮ Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \) ⋮ \(P_{11}\)-coloring of oriented graphs ⋮ Homomorphism bounds for oriented planar graphs of given minimum girth ⋮ \(L(2,1)\)-labelings of some families of oriented planar graphs ⋮ Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs ⋮ Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs ⋮ Homomorphisms of 2-edge-colored graphs ⋮ Oriented colorings of partial 2-trees ⋮ Oriented cliques and colorings of graphs with low maximum degree ⋮ On the existence and non-existence of improper homomorphisms of oriented and $2$-edge-coloured graphs to reflexive targets

Cites Work

• Unnamed Item
• Unnamed Item
• Oriented colorings of triangle-free planar graphs
• Oriented vertex and arc colorings of outerplanar graphs
• Oriented colorings of partial 2-trees
• Antisymmetric flows and strong colourings of oriented graphs
• On the maximum average degree and the oriented chromatic number of a graph
• Good and semi-strong colorings of oriented planar graphs
• The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
• An oriented 7-colouring of planar graphs with girth at least 7
• An oriented colouring of planar graphs with girth at least 4
• Acyclic and oriented chromatic numbers of graphs
• The chromatic number of oriented graphs
• Homomorphism bounds for oriented planar graphs
• Oriented graph coloring

This page was built for publication: An oriented coloring of planar graphs with girth at least five