Oriented colorings of partial 2-trees

DOI10.1016/j.ipl.2008.04.007zbMath1189.05063OpenAlexW2046662685MaRDI QIDQ975406

Alexandre Pinlou, Pascal Ochem

Publication date: 9 June 2010

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

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

zbMATH Keywords

combinatorial problemsgirthseries-parallel graphoriented chromatic numberpartial 2-tree\(K_{4}\) minor-free graph

Mathematics Subject Classification ID

Trees (05C05) 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 ⋮ Homomorphism bounds for oriented planar graphs of given minimum girth ⋮ On nice and injective-nice tournaments ⋮ Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs ⋮ Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs ⋮ A note on integral generalized flows in directed partial 2-trees ⋮ Homomorphisms of 2-edge-colored graphs ⋮ Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms ⋮ Oriented cliques and colorings of graphs with low maximum degree ⋮ An oriented coloring of planar graphs with girth at least five ⋮ On the oriented coloring of the disjoint union of graphs

Cites Work

• Unnamed Item
• Oriented colorings of triangle-free planar graphs
• Oriented vertex and arc colorings of outerplanar graphs
• 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
• Colorings and girth of oriented planar graphs
• Coloring the square of a \(K_{4}\)-minor free graph
• 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
• Homomorphism bounds for oriented planar graphs

This page was built for publication: Oriented colorings of partial 2-trees