- Tytuł:
- Vertex coloring the square of outerplanar graphs of low degree
- Autorzy:
-
Agnarsson, Geir
Halldórsson, Magnús - Tematy:
-
outerplanar
chromatic number
power of a graph
weak dual - Pokaż więcej
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Powiązania:
- https://bibliotekanauki.pl/articles/744076.pdf Link otwiera się w nowym oknie
- Opis:
- Vertex colorings of the square of an outerplanar graph have received a lot of attention recently. In this article we prove that the chromatic number of the square of an outerplanar graph of maximum degree Δ = 6 is 7. The optimal upper bound for the chromatic number of the square of an outerplanar graph of maximum degree Δ ≠ 6 is known. Hence, this mentioned chromatic number of 7 is the last and only unknown upper bound of the chromatic number in terms of Δ.
- Dostawca treści:
- Biblioteka Nauki
Artykuł