Name
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 . |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.dam.2009.09.017 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
2-edge-colored graph,outerplanar graph,partial 3-trees,discharging procedure,smallest number,planar graph,considered class,girth,homomorphism,maximum average degree,partial 2-trees,2-edge-colored graph h,partial k -tree,various graph class,graph coloring,edge coloring | Discrete mathematics,Outerplanar graph,Combinatorics,Indifference graph,Partial k-tree,Chordal graph,Graph product,Cograph,Pathwidth,1-planar graph,Mathematics | Journal |
Volume | Issue | ISSN |
158 | 12 | Discrete Applied Mathematics |
Citations | PageRank | References |
5 | 0.53 | 10 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amanda Montejano | 1 | 10 | 8.07 |
| Pascal Ochem | 2 | 258 | 36.91 |
| Alexandre Pinlou | 3 | 167 | 20.47 |
| André Raspaud | 4 | 850 | 85.91 |
| íric Sopena | 5 | 5 | 0.53 |