Equitable Total Coloring of Corona of Cubic Graphs
The minimum number of total independent partition sets of V ∪ E of a graph G = (V, E) is called the total chromatic number of G, denoted by X′(G). If the di erence between cardinalities of any two total independent sets is at most one, then the minimum number of total independent partition sets of V...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
University of Zielona Góra
2021-11-01
|
| Edice: | Discussiones Mathematicae Graph Theory |
| Témata: | |
| On-line přístup: | https://doi.org/10.7151/dmgt.2245 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|