Name
Abstract | ||
|---|---|---|
In this paper, we prove that every 3-chromatic connected graph, except C7, admits a 3-vertex coloring in which every vertex is the beginning of a 3-chromatic path with 3 vertices. It is a special case of a conjecture due to S. Akbari, F. Khaghanpoor, and S. Moazzeni stating that every connected graph G other than C7 admits a χ(G)-coloring such that every vertex of G is the beginning of a colorful path (i.e. a path on χ(G) vertices containing a vertex of each color). We also provide some support for the conjecture in the case of 4-chromatic graphs. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.disc.2017.01.016 | Discrete Mathematics |
Keywords | Field | DocType |
Vertex coloring,Colorful path,Rainbow coloring | Complete coloring,Discrete mathematics,Combinatorics,Fractional coloring,Induced path,Vertex (graph theory),Neighbourhood (graph theory),Cycle graph,Vertex separator,Robbins' theorem,Mathematics | Journal |
Volume | Issue | ISSN |
340 | 5 | 0012-365X |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stéphane Bessy | 1 | 117 | 19.68 |
| Nicolas Bousquet | 2 | 62 | 13.14 |