The List Edge Coloring and List Total Coloring of Planar Graphs with Maximum Degree at Least 7
A graph G is edge k-choosable (respectively, total k-choosable) if, whenever we are given a list L(x) of colors with |L(x)| = k for each x ∈ E(G) (x ∈ E(G) ∪ V (G)), we can choose a color from L(x) for each element x such that no two adjacent (or incident) elements receive the same color. The list e...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2020-11-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2160 |