The chromatic number of sparse colored mixed graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

The chromatic number of sparse colored mixed graphs

Résumé

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.
Fichier principal
Vignette du fichier
mprs09.pdf (49.16 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00409025 , version 1 (05-08-2009)

Identifiants

Citer

Amanda Montejano, Alexandre Pinlou, André Raspaud, Eric Sopena. The chromatic number of sparse colored mixed graphs. EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.363-367, ⟨10.1016/j.endm.2009.07.060⟩. ⟨hal-00409025⟩
230 Consultations
310 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More