We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
WORM COLORINGS.
- Authors
GODDARD, WAYNE; WASH, KIRSTI; HONGHAI XU
- Abstract
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.
- Subjects
GRAPH coloring; SUBGRAPHS; ISOMORPHISM (Mathematics); MATHEMATICAL optimization; GRAPH theory
- Publication
Discussiones Mathematicae: Graph Theory, 2015, Vol 35, Issue 3, p571
- ISSN
1234-3099
- Publication type
Article
- DOI
10.7151/dmgt.1814