The oriented chromatic number of Halin graphs

DOI10.1016/j.ipl.2013.09.011zbMath1320.05037arXiv1307.4901OpenAlexW2013932745MaRDI QIDQ2350598

Andrzej Szepietowski, Janusz Dybizbański

Publication date: 25 June 2015

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

Full work available at URL: https://arxiv.org/abs/1307.4901

zbMATH Keywords

graph coloringcombinatorial problemsoriented graph coloringoriented chromatic numberHalin graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Homomorphisms and colourings of oriented graphs: an updated survey ⋮ 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 colourings of graphs with maximum degree three and four ⋮ Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs ⋮ Efficient computation of the oriented chromatic number of recursively defined digraphs ⋮ Oriented coloring on recursively defined digraphs ⋮ Oriented cliques and colorings of graphs with low maximum degree ⋮ Chromatic polynomials of oriented graphs

Cites Work

• Unnamed Item
• Oriented chromatic number of grids is greater than 7
• A note on the oriented chromatic number of grids
• On the oriented chromatic number of Halin 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
• On the oriented chromatic number of graphs with given excess
• Acyclic and oriented chromatic numbers of graphs
• The chromatic number of oriented graphs
• Oriented graph coloring

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