An Analogue of DP-Coloring for Variable Degeneracy and its Applications
A graph G is list vertex k-arborable if for every k-assignment L, one can choose f(v) ∈ L(v) for each vertex v so that vertices with the same color induce a forest. In [6], Borodin and Ivanova proved that every planar graph without 4-cycles adjacent to 3-cycles is list vertex 2-arborable. In fact, t...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
University of Zielona Góra
2022-02-01
|
| Colección: | Discussiones Mathematicae Graph Theory |
| Materias: | |
| Acceso en línea: | https://doi.org/10.7151/dmgt.2238 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|