Homomorphisms of 2-edge-colored graphs

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: Journal
• Year: 2010
• Where: DAM
• Authors: Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Eric Sopena
• Keywords: 2-edge-colored Graph, DAM 2010, Outerplanar Graphs, Various Graph Classes