Homomorphisms of 2-Edge-Colored Graphs - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Reports 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, graphs with bounded maximum average degree) 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.
No file

Dates and versions

lirmm-00266540 , version 1 (24-03-2008)

Identifiers

  • HAL Id : lirmm-00266540 , version 1

Cite

Amanda Montejano, Pascal Ochem, Alexandre Pinlou, André Raspaud, Eric Sopena. Homomorphisms of 2-Edge-Colored Graphs. RR-08008, 2008, pp.26. ⟨lirmm-00266540⟩
131 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More