On the oriented chromatic number of Halin graphs

Authors:
Mohammad Hosseini Dolama;Éric Sopena
Affiliations:
LaBRI, Université Bordeaux 1, 351 cours de la Libération, 33405 Talence Cedex, France;LaBRI, Université Bordeaux 1, 351 cours de la Libération, 33405 Talence Cedex, France
Venue:
Information Processing Letters
Year:
2006

Citing 6
Cited 2

Good and semi-strong colorings of oriented planar graphs

Information Processing Letters
Colorings and girth of oriented planar graphs

Proceedings of an international symposium on Graphs and combinatorics
The chromatic number of oriented graphs

Journal of Graph Theory
Oriented graph coloring

Discrete Mathematics
On the oriented chromatic number of grids

Information Processing Letters
Oriented colorings of triangle-free planar graphs

Information Processing Letters

Oriented chromatic number of grids is greater than 7

Information Processing Letters
The oriented chromatic number of Halin graphs

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

An oriented k-coloring of an oriented graph G is a mapping c:V(G)-{1,2,...,k} such that (i) if xy@?E(G) then c(x)c(y) and (ii) if xy,zt@?E(G) then c(x)=c(t)@?c(y)c(z). The oriented chromatic number @g-(G) of an oriented graph G is defined as the smallest k such that G admits an oriented k-coloring. We prove in this paper that every Halin graph has oriented chromatic number at most 9, improving a previous bound proposed by Vignal.