Name
Abstract | ||
|---|---|---|
In this paper, it is shown that if the maximum degree Δ of a graph is large relative to the genus of the embedding than the edge-face chromatic number of the graph is at most Δ+1 and its vertex-edge-face chromatic number is at most Δ+2 . Both results are best possible. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0012-365X(00)00064-9 | Discrete Mathematics |
Keywords | Field | DocType |
simultaneous colorings,graph: coloring,discharging,surface,embedded graph,maximum degree,graph,graph coloring | Edge coloring,Discrete mathematics,Combinatorics,Foster graph,Friendship graph,Degree (graph theory),Brooks' theorem,Petersen graph,Windmill graph,Butterfly graph,Mathematics | Journal |
Volume | Issue | ISSN |
224 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
3 | 0.60 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel P. Sanders | 1 | 471 | 45.56 |
| John Maharry | 2 | 75 | 7.85 |