Name
Abstract | ||
|---|---|---|
A plane graph G is edge-face k-colorable if its edges and faces can be colored with k colors such that any two adjacent or incident elements receive different colors. It is known that every plane graph G of maximum degree Delta >= 8 is edge-face (Delta + 1)-colorable. The condition Delta >= 8 is improved to Delta >= 7 in this paper. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1002/jgt.22538 | JOURNAL OF GRAPH THEORY |
Keywords | DocType | Volume |
discharging method, edge-face coloring, maximum degree, plane graph | Journal | 95 |
Issue | ISSN | Citations |
1 | 0364-9024 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yiqiao Wang | 1 | 0 | 0.68 |
| Xiaoxue Hu | 2 | 0 | 0.34 |
| Weifan Wang | 3 | 868 | 89.92 |
| Ko-wei Lih | 4 | 529 | 58.80 |