arXiv Analytics

Sign in

arXiv:0906.1857 [math.CO]AbstractReferencesReviewsResources

On the circumference, connectivity and dominating cycles

Zh. G. Nikoghosyan

Published 2009-06-10Version 1

Every 4-connected graph with minimum degree $\delta$ and connectivity $\kappa$ either has a cycle of length at least $4\delta-2\kappa$ or has a dominating cycle.

Comments: 31 pages
Categories: math.CO
Subjects: 05C38, 05C40
Related articles: Most relevant | Search more
arXiv:0906.3946 [math.CO] (Published 2009-06-22)
The rainbow $k$-connectivity of two classes of graphs
arXiv:0907.2490 [math.CO] (Published 2009-07-15)
A Lower Bound for the Circumference Involving Connectivity
arXiv:1106.1255 [math.CO] (Published 2011-06-07)
Connectivity of Kronecker products by K2

Links

Toolbox