- Tytuł:
- Worm Colorings
- Autorzy:
-
Goddard, Wayne
Wash, Kirsti
Xu, Honghai - Powiązania:
- https://bibliotekanauki.pl/articles/31339329.pdf
- Data publikacji:
- 2015-08-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
coloring
rainbow
monochromatic
forbidden
path - Opis:
- Given a coloring of the vertices, we say subgraph H is monochromatic if every vertex of H is assigned the same color, and rainbow if no pair of vertices of H are assigned the same color. Given a graph G and a graph F, we define an F-WORM coloring of G as a coloring of the vertices of G without a rainbow or monochromatic subgraph H isomorphic to F. We present some results on this concept especially as regards to the existence, complexity, and optimization within certain graph classes. The focus is on the case that F is the path on three vertices.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2015, 35, 3; 571-584
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł