Independence Number and Packing Coloring of Generalized Mycielski Graphs
For a positive integer k ⩾ 1, a graph G with vertex set V is said to be k-packing colorable if there exists a mapping f : V ↦ {1, 2, . . ., k} such that any two distinct vertices x and y with the same color f(x) = f(y) are at distance at least f(x) + 1. The packing chromatic number of a graph G, den...
שמור ב:
| Principais autores: | , , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
University of Zielona Góra
2021-08-01
|
| סדרה: | Discussiones Mathematicae Graph Theory |
| נושאים: | |
| גישה מקוונת: | https://doi.org/10.7151/dmgt.2337 |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|