Homomorphisms of 2-Edge-Colored Graphs

Amanda Montejano; Pascal Ochem; Alexandre Pinlou; André Raspaud; Eric Sopena

Homomorphisms of 2-Edge-Colored Graphs

Amanda Montejano ¹ Pascal Ochem ² Alexandre Pinlou ^{3, *} André Raspaud ⁴ Eric Sopena ⁴

* Corresponding author

1 Applied Mathematics IV Department

2 LRI - Laboratoire de Recherche en Informatique

3 ALGCO - Algorithmes, Graphes et Combinatoire

LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier

4 LaBRI - Laboratoire Bordelais de Recherche en Informatique

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.

Document type :

Reports

Domain :

Computer Science [cs] / Discrete Mathematics [cs.DM]

Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00266540
Contributor : Alexandre Pinlou <>
Submitted on : Monday, March 24, 2008 - 4:27:19 PM
Last modification on : Thursday, May 24, 2018 - 3:59:22 PM

Homomorphisms of 2-Edge-Colored Graphs

Identifiers

Collections

Citation

Export

Metrics

239

Contact

Homomorphisms of 2-Edge-Colored Graphs

Identifiers

Collections

Citation

Export

Share

Metrics

239

Contact