On the Connection Between the Chromatic Number of a Graph and the Number of Cycles Covering a Vertex or an Edge
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Mathematical Sciences"
DOI: 10.1007/s10958-018-3853-6
Abstract: We prove several tight bounds on the chromatic number of a graph in terms of the minimum number of simple cycles covering a vertex or an edge of this graph. Namely, we prove that X(G) ≤ k… read more here.
Keywords: edge; graph; number; cycles covering ... See more keywords