The chromatic numbers of double coverings of a graph
Combinatorics
2008-09-04 v2
Abstract
If we fix a spanning subgraph of a graph , we can define a chromatic number of with respect to and we show that it coincides with the chromatic number of a double covering of with co-support . We also find a few estimations for the chromatic numbers of with respect to .
Cite
@article{arxiv.math/0507110,
title = {The chromatic numbers of double coverings of a graph},
author = {Dongseok Kim and Jaeun Lee},
journal= {arXiv preprint arXiv:math/0507110},
year = {2008}
}
Comments
10 pages