On the oriented chromatic number of Halin graphs
From MaRDI portal
Publication:844210
DOI10.1016/J.IPL.2005.03.016zbMATH Open1178.05040OpenAlexW2090256643MaRDI QIDQ844210FDOQ844210
Authors: Mohammad Hosseini Dolama, Éric 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
Recommendations
graph coloringgraph homomorphismcombinatorial problemsoriented chromatic numberHalin graphoriented graph coloring
Cites Work
- On the maximum average degree and the oriented chromatic number of a graph
- On the oriented chromatic number of grids
- 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
- Oriented colorings of triangle-free planar graphs
Cited In (11)
- Homomorphisms and colourings of oriented graphs: an updated survey
- Oriented chromatic number of grids is greater than 7
- Oriented chromatic number of Cartesian products and strong products of paths
- Oriented graph coloring
- The 2-dipath chromatic number of Halin graphs
- 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 \)
- On deeply critical oriented graphs
- On the oriented chromatic number of graphs with given excess
- The oriented chromatic number of Halin graphs
- Some further results on the eccentric distance sum
This page was built for publication: On the oriented chromatic number of Halin graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844210)