Equitable Coloring and Equitable Choosability of Graphs with Small Maximum Average Degree
A graph is said to be equitably k-colorable if the vertex set V (G) can be partitioned into k independent subsets V1, V2, . . . , Vk such that ||Vi|−|Vj || ≤ 1 (1 ≤ i, j ≤ k). A graph G is equitably k-choosable if, for any given k-uniform list assignment L, G is L-colorable and each color appears on...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
University of Zielona Góra
2018-08-01
|
| Edice: | Discussiones Mathematicae Graph Theory |
| Témata: | |
| On-line přístup: | https://doi.org/10.7151/dmgt.2049 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|