Answers to some problems about graph coloring test graphs

From MaRDI portal
Publication:482122




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 gamma1 and gamma2 such that (K,gamma1) is a Stiefel-Whitney test graph, but (K,gamma2) is not. These are answers to some of the problems suggested by Kozlov.









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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482122)