Name
Abstract | ||
|---|---|---|
In this article, we introduce and study the properties of some target graphs for 2-edge-colored homomorphism. Using these properties, we obtain in particular that the 2-edge-colored chromatic number of the class of triangle-free planar graphs is at most 50. We also show that it is at least 12. (C) 2016 Wiley Periodicals, Inc. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1002/jgt.22059 | JOURNAL OF GRAPH THEORY |
Keywords | Field | DocType |
2-edge-colored graph,graph homomorphism,discharging method | Discrete mathematics,Topology,Outerplanar graph,Indifference graph,Combinatorics,Graph homomorphism,Chordal graph,Graph product,Book embedding,Pathwidth,1-planar graph,Mathematics | Journal |
Volume | Issue | ISSN |
85 | 1 | 0364-9024 |
Citations | PageRank | References |
3 | 0.42 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pascal Ochem | 1 | 258 | 36.91 |
| Alexandre Pinlou | 2 | 167 | 20.47 |
| Sagnik Sen | 3 | 21 | 13.13 |