The chromatic numbers of double coverings of a graph
Reviewed by Pithpith:VSCC5SHHopen to challenge →
classification
math.CO
keywords
chromaticdoublegraphnumbernumbersrespectco-supportcoincides
read the original abstract
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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.