On the oriented chromatic number of Halin graphs

DOI10.1016/j.ipl.2005.03.016zbMath1178.05040OpenAlexW2090256643MaRDI QIDQ844210

Mohammad Hosseini Dolama, Eric Sopena

Publication date: 18 January 2010

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

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

zbMATH Keywords

graph coloringcombinatorial problemsgraph homomorphismoriented graph coloringoriented chromatic numberHalin graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Homomorphisms and colourings of oriented graphs: an updated survey ⋮ Oriented chromatic number of Cartesian products and strong products of paths ⋮ Extremal Halin graphs with respect to the signless Laplacian spectra ⋮ 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 ⋮ Some further results on the eccentric distance sum ⋮ The oriented chromatic number of Halin graphs

Cites Work

• Oriented colorings of triangle-free planar graphs
• On the oriented chromatic number of grids
• On the maximum average degree and the oriented chromatic number of a graph
• Good and semi-strong colorings of oriented planar graphs
• Colorings and girth of oriented planar graphs
• The chromatic number of oriented graphs
• Oriented graph coloring

This page was built for publication: On the oriented chromatic number of Halin graphs