Answers to some problems about graph coloring test graphs

Abstract: We prove that a graph whose chromatic number is 2 is a homotopy test graph. We also prove that there is a graph

K

with two involutions

g a m m a_{1}

and

g a m m a_{2}

such that

(K, g a m m a_{1})

is a Stiefel-Whitney test graph, but

(K, g a m m a_{2})

is not. These are answers to some of the problems suggested by Kozlov.

Cites Work

Cited In (3)

This page was built for publication: Answers to some problems about graph coloring test graphs