Homomorphisms of 2-Edge-Colored Graphs

Abstract : In this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2-trees, partial 3-trees, planar graphs) and the problem is to find, for each class, the smallest number of vertices of a 2-edge-colored graph H such that each graph of the considered class admits a homomorphism to H.
Type de document :
Communication dans un congrès
IV Latin American Algorithms, Graphs, and Optimization Symposium, Nov 2007, Puerto Varas, Chile, 30, pp.33-38, 2008, Electronic Notes in Discrete Mathematics. 〈http://www.dii.uchile.cl/~lagos07〉. 〈10.1016/j.endm.2008.01.007〉
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00196757
Contributeur : Alexandre Pinlou <>
Soumis le : jeudi 13 décembre 2007 - 14:42:21
Dernière modification le : mardi 24 avril 2018 - 13:39:09

Identifiants

Citation

Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Eric Sopena. Homomorphisms of 2-Edge-Colored Graphs. IV Latin American Algorithms, Graphs, and Optimization Symposium, Nov 2007, Puerto Varas, Chile, 30, pp.33-38, 2008, Electronic Notes in Discrete Mathematics. 〈http://www.dii.uchile.cl/~lagos07〉. 〈10.1016/j.endm.2008.01.007〉. 〈lirmm-00196757〉

Partager

Métriques

Consultations de la notice

238