List Edge Colorings of Planar Graphs without Adjacent 7-Cycles
In this paper, we get that G is edge-k-choosable (k=max10,ΔG) for planar graph G without adjacent 7-cycles.
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2021-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2021/6695833 |