Nov 12, 2010 · Let G be a k-connected graph of order n, α: = α(G) the independence number of G, and c(G) the circumference of G. Chvátal and Erdős proved ...
The independence number of a graph is an important parameter, and the investigation on the relations between the independence number and other graph parameters ...
Fouquet and Jolivet conjectured that if G is a k-connected nvertex graph with independence number a ≥ k ≥ 2, then G has circumference at least k(n+a-k)/a.
The Chvátal–Erdős Theorem states that every graph whose connectivity is at least its independence number has a spanning cycle. In 1976, Fouquet and Jolivet ...
People also ask
What is the circumference of a graph theory?
How to find the independence number of a graph?
What is a connected graph?
What is an AK connected graph?
Jan 2, 2011 · Abstract. The Chvátal–Erd˝os Theorem states that every graph whose connectivity is at least its independence number has a spanning cycle.
Circumferences of k-connected Graphs Involving Independence Numbers, J. Graph Theory. 68 (2011), no. 1, 55-76 (with Z. Hu and Y. Wu). [102]. Saturation numbers ...
Mar 15, 2011 · The Chvátal–Erd˝os Theorem states that every graph whose connec- tivity is at least its independence number has a spanning cycle.
Longest Cycles in k-connected Graphs with Given Independence Number. Douglas B. West. Department of Mathematics. University of Illinois at Urbana-Champaign.
Missing: involving | Show results with:involving
We show that every simple graph of order 2r and minimum degree ≧4r/3 has the property that for any partition of its vertex set into 2-subsets, there is a cycle ...
Circumferences of k-connected graphs involving independence numbers. Let G be a k-connected graph of order n, α: = α(G) the independence number of G, and c(G) ...