Dongseok Kim, Jaeun Lee
Published 2005-07-06, updated 2007-09-14Version 2
If we fix a spanning subgraph $H$ of a graph $G$, we can define a chromatic number of $H$ with respect to $G$ and we show that it coincides with the chromatic number of a double covering of $G$ with co-support $H$. We also find a few estimations for the chromatic numbers of $H$ with respect to $G$.
Comments: 10 pages
Journal: Discrete Math. 308(2008) 5078-5086
Topological lower bounds for the chromatic number: A hierarchy
Two Erdos problems on lacunary sequences: Chromatic number and Diophantine approximation
On the Chromatic Number of $\mathbb{R}^n$ for Small Values of $n$
![QR code for arXiv:math/0507110 [math.CO]](http://oss.arxitics.com/images/favicon.svg)