| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652366 | Electronic Notes in Discrete Mathematics | 2009 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
