Sciweavers

Share
ENDM
2007

Oriented vertex and arc colorings of partial 2-trees

9 years 11 months ago
Oriented vertex and arc colorings of partial 2-trees
d Abstract) Pascal Ochem∗, Alexandre Pinlou† LaBRI, Université Bordeaux 1, 351, Cours de la Libération, 33405 Talence Cedex, France March 16, 2007 A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping ϕ from V(G) to V(H), that is ϕ(x)ϕ(y) is an arc in H whenever xy is an arc in G. The oriented chromatic number of G is the minimum order of an oriented graph H such that G has a homomorphism to H. The oriented chromatic index of G is the minimum order of an oriented graph H such that the line-digraph of G has a homomorphism to H. In this paper, we determine the oriented chromatic number (resp. the oriented chromatic index) of the class of partial 2-trees for every girth g ≥ 3 (resp. for every girth g ≥ 3 excepted three).
Pascal Ochem, Alexandre Pinlou
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2007
Where ENDM
Authors Pascal Ochem, Alexandre Pinlou
Comments (0)
books