Title of article
Chromatic number of sparse colored mixed planar graphs
Author/Authors
Montejano، نويسنده , , Amanda and Pinlou، نويسنده , , Alexandre and Raspaud، نويسنده , , André and Sopena، نويسنده , , ةric، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
5
From page
363
To page
367
Abstract
A colored mixed graph has vertices linked by both colored arcs and colored edges. The chromatic number of such a graph G is defined as the smallest order of a colored mixed graph H such that there exists a (arc-color preserving) homomorphism from G to H. We study in this paper the colored mixed chromatic number of planar graphs, partial 2-trees and outerplanar graphs with given girth.
Keywords
Mixed graph , girth , chromatic number , Homomorphism , planar
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2009
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455153
Link To Document