Oriented colorings of triangle-free planar graphs

DOI10.1016/j.ipl.2004.06.012zbMath1173.68593OpenAlexW1963524383MaRDI QIDQ834898

Pascal Ochem

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.06.012

zbMATH Keywords

combinatorial problemsoriented coloringdischarging

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Homomorphisms and colourings of oriented graphs: an updated survey ⋮ An oriented 6-coloring of planar graphs with girth at least 9 ⋮ On the oriented chromatic number of Halin graphs ⋮ The 2-dipath chromatic number of Halin graphs ⋮ Oriented vertex and arc colorings of outerplanar graphs ⋮ Oriented colorings of 2-outerplanar graphs ⋮ Homomorphism bounds for oriented planar graphs of given minimum girth ⋮ Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs ⋮ A study on oriented relative clique number ⋮ Oriented colorings of partial 2-trees ⋮ Oriented cliques and colorings of graphs with low maximum degree ⋮ An oriented coloring of planar graphs with girth at least five

Cites Work

• Unnamed Item
• Note to the paper of Grünbaum on acyclic colorings
• On acyclic colorings of planar graphs
• 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
• Oriented graph coloring