arXiv Analytics

Sign in

arXiv:0906.5053 [math.CO]AbstractReferencesReviewsResources

Large cycles in 4-connected graphs

M. Zh. Nikoghosyan, Zh. G. Nikoghosyan

Published 2009-06-27Version 1

Every 4-connected graph $G$ with minimum degree $\delta$ and connectivity $\kappa$ either contains a cycle of length at least $4\delta-\kappa-4$ or every longest cycle in $G$ is a dominating cycle.

Comments: 4 pages
Categories: math.CO
Subjects: 05C38, 05C40
Related articles: Most relevant | Search more
arXiv:2003.09750 [math.CO] (Published 2020-03-21)
Large cycles in essentially 4-connected graphs
arXiv:2211.16446 [math.CO] (Published 2022-11-26)
A Note on Large Cycles in Graphs Around Conjectures of Bondy and Jung
arXiv:0905.1394 [math.CO] (Published 2009-05-09)
On Longest Cycle $C$ of a graph $G$ via Structures of $G-C$

Links

Toolbox