Name
Abstract | ||
|---|---|---|
AbstractWe prove that the list chromatic index of a graph of maximum degree Δ and treewidth ï 2Δ-3 is Δ; and that the total chromatic number of a graph of maximum degree Δ and treewidth ï Δ/3+1 is Δ+1. This improves results by Meeks and Scott. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1002/jgt.21874 | Periodicals |
Keywords | Field | DocType |
list colouring,total colouring,tree width | Topology,Discrete mathematics,Edge coloring,Graph,Combinatorics,Total coloring,Tree-depth,Chromatic scale,List edge-coloring,Degree (graph theory),Treewidth,Mathematics | Journal |
Volume | Issue | ISSN |
81 | 3 | 0364-9024 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| henning bruhn | 1 | 177 | 24.93 |
| richard lang | 2 | 0 | 0.34 |
| maya stein | 3 | 81 | 15.65 |