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 :
Article dans une revue
Discrete Applied Mathematics, Elsevier, 2010, 158 (12), pp.1365-1379. 〈10.1016/j.dam.2009.09.017〉
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00433039
Contributeur : Alexandre Pinlou <>
Soumis le : mercredi 18 novembre 2009 - 07:19:48
Dernière modification le : jeudi 24 mai 2018 - 15:59:22

Lien texte intégral

Identifiants

Citation

Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Eric Sopena. Homomorphisms of 2-edge-colored graphs. Discrete Applied Mathematics, Elsevier, 2010, 158 (12), pp.1365-1379. 〈10.1016/j.dam.2009.09.017〉. 〈lirmm-00433039〉

Partager

Métriques

Consultations de la notice

303