Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs

DOI10.1016/j.endm.2011.05.022zbMath1268.05081OpenAlexW2175801803MaRDI QIDQ5891099

Pascal Ochem, Alexandre Pinlou

Publication date: 23 July 2013

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

Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00530543/file/op10.pdf

zbMATH Keywords

girthplanar graphoriented coloringdischarging procedure2-outerplanar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

An oriented 6-coloring of planar graphs with girth at least 9 ⋮ Homomorphism bounds for oriented planar graphs of given minimum girth

Cites Work

• Unnamed Item
• Oriented vertex and arc colorings of outerplanar graphs
• Oriented colorings of 2-outerplanar graphs
• Oriented colorings of partial 2-trees
• An oriented coloring of planar graphs with girth at least five
• 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
• The chromatic number of oriented graphs
• Oriented graph coloring

This page was built for publication: Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs