On the oriented chromatic number of graphs with given excess

DOI10.1016/j.disc.2005.12.023zbMath1145.05022OpenAlexW2085650440MaRDI QIDQ2497471

Mohammad Hosseini Dolama, Eric Sopena

Publication date: 4 August 2006

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

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

zbMATH Keywords

graph coloringgraph homomorphismoriented graph coloringBetti number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Oriented chromatic number of Cartesian products and strong products of paths ⋮ Oriented chromatic number of Cartesian products \(P_m \square P_n\) and \(C_m \square P_n \) ⋮ Oriented chromatic number of grids is greater than 7 ⋮ The oriented chromatic number of Halin graphs

Cites Work

• Unnamed Item
• 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
• On deeply critical oriented graphs
• Acyclic and oriented chromatic numbers of graphs
• The chromatic number of oriented graphs
• Oriented graph coloring

This page was built for publication: On the oriented chromatic number of graphs with given excess