Name
Abstract | ||
|---|---|---|
In this paper, we prove that every graph with maximum degree six is acyclically 10-colorable, thus improving the main result of Hervé Hocquard (2011). |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.disc.2014.01.022 | Discrete Mathematics |
Keywords | Field | DocType |
Graph coloring,Bounded degree graphs,Acyclic coloring | Edge coloring,Discrete mathematics,Complete coloring,Combinatorics,Fractional coloring,List coloring,Degree (graph theory),Brooks' theorem,Mathematics,Acyclic coloring,Graph coloring | Journal |
Volume | Issue | ISSN |
325 | 1 | 0012-365X |
Citations | PageRank | References |
0 | 0.34 | 14 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yancai Zhao | 1 | 0 | 1.01 |
| Lian-ying Miao | 2 | 24 | 8.45 |
| Shiyou Pang | 3 | 0 | 0.34 |
| Wenyao Song | 4 | 1 | 1.38 |