Strong oriented chromatic number of planar graphs without cycles of specific lengths
References (9)
- et al.
On the maximum average degree and the oriented chromatic number of a graph
Discrete Math.
(1999) Antisymmetric flows and strong oriented coloring of planar graphs
Discrete Math.
(2003)Oriented graph coloring
Discrete Math.
(2001)- et al.
Acyclic and oriented chromatic numbers of graphs
J. Graph Theory
(1997)
There are more references available in the full text version of this article.
Cited by (1)
Strong oriented chromatic number of planar graphs without short cycles
2008, Discrete Mathematics and Theoretical Computer Science
- 2
Département Mathématiques et Informatique Appliqués, Univ. Paul-Valéry, Montpellier 3, Route de Mende, 34199 Montpellier Cedex 5, France
Copyright © 2008 Elsevier B.V. All rights reserved.