Homomorphisms of 2-Edge-Colored Graphs - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2008

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.

Dates and versions

lirmm-00196757 , version 1 (13-12-2007)

Identifiers

Cite

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⟩
184 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More