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.
Document type :
Conference papers
Complete list of metadatas

Contributor : Alexandre Pinlou <>
Submitted on : Thursday, December 13, 2007 - 2:42:21 PM
Last modification on : Thursday, May 24, 2018 - 3:59:22 PM



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, pp.33-38, ⟨10.1016/j.endm.2008.01.007⟩. ⟨lirmm-00196757⟩



Record views