Oriented Colorings of Partial 2-trees - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Reports Year : 2007

Oriented Colorings of Partial 2-trees

Abstract

A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping f from V(G) to V(H), that is f(x)f(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. In this paper, we determine the oriented chromatic number of the class of partial 2-trees for every girth g>= 3.
Fichier principal
Vignette du fichier
op07b.pdf (82.93 Ko) Télécharger le fichier
Loading...

Dates and versions

lirmm-00190875 , version 1 (23-11-2007)

Identifiers

  • HAL Id : lirmm-00190875 , version 1

Cite

Pascal Ochem, Alexandre Pinlou. Oriented Colorings of Partial 2-trees. RR-07026, 2007, pp.7. ⟨lirmm-00190875⟩
124 View
368 Download

Share

Gmail Facebook X LinkedIn More