Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable (Q2230029)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable |
scientific article |
Statements
Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable (English)
0 references
17 September 2021
0 references
Summary: In this paper, by applying the discharging method, we show that if \(G\) is a planar graph with a maximum degree of \(\Delta=6\) that does not contain any adjacent 8-cycles, then \(G\) is of class 1.
0 references
