Worm Colorings

Wayne Goddard, Kirsti Wash, and Honghai Xu. "Worm Colorings." Discussiones Mathematicae Graph Theory 35.3 (2015): 571-584. <http://eudml.org/doc/271211>.

@article{WayneGoddard2015,
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.},
author = {Wayne Goddard, Kirsti Wash, Honghai Xu},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {coloring; rainbow; monochromatic; forbidden; path.; path},
language = {eng},
number = {3},
pages = {571-584},
title = {Worm Colorings},
url = {http://eudml.org/doc/271211},
volume = {35},
year = {2015},
}

TY - JOUR
AU - Wayne Goddard
AU - Kirsti Wash
AU - Honghai Xu
TI - Worm Colorings
JO - Discussiones Mathematicae Graph Theory
PY - 2015
VL - 35
IS - 3
SP - 571
EP - 584
AB - 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.
LA - eng
KW - coloring; rainbow; monochromatic; forbidden; path.; path
UR - http://eudml.org/doc/271211
ER -