Name
Title | ||
|---|---|---|
The entire chromatic number of graphs embedded on the torus with large maximum degree. |
Abstract | ||
|---|---|---|
•We prove that a toroidal graph with Δ≥10 is entirely (Δ+2)-colorable.•We establish a structural lemma about toroidal graphs.•We provide a polynomial-time algorithm on entire coloring of toroidal graphs. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.tcs.2017.05.018 | Theoretical Computer Science |
Keywords | Field | DocType |
Embedded graph,Torus,Entire coloring,Maximum degree | Edge coloring,Discrete mathematics,Combinatorics,Graph power,Fractional coloring,List coloring,Brooks' theorem,Degree (graph theory),Toroidal graph,Mathematics,Graph coloring | Journal |
Volume | ISSN | Citations |
689 | 0304-3975 | 1 |
PageRank | References | Authors |
0.36 | 4 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaoxue Hu | 1 | 7 | 4.25 |
| Ping Wang | 2 | 93 | 44.15 |
| Yiqiao Wang | 3 | 494 | 42.81 |
| Weifan Wang | 4 | 868 | 89.92 |