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
The Turán number of the graph 3P5
Sign Up to like & getrecommendations! Published in 2020 at "Filomat"
DOI: 10.2298/fil2010395f
Abstract: The Turán number ex(n,H) of a graph H, is the maximum number of edges in a graph of order n which does not contain H as a subgraph. Let Ex(n,H) denote all H-free graphs on… read more here.
Keywords: tur number; graph 3p5; number; number graph ... See more keywords