Large cycles in 4-connected graphs

2009/06/27 by M. Zh. Nikoghosyan, Nikoghosyan, M. Zh., Zh. G. Nikoghosyan +1
Computer Science · Engineering · Mathematics · #05C38 #05C40 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Interconnection Networks and Systems #graph theory and CDMA systems #math.CO #msc:05C38 #msc:05C40

paper · pdf · doi:10.48550/arxiv.0906.5053

4 pages

arxiv created 2009/06/27 · openalex publication_date 2009/06/27 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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

Related

• On the circumference, connectivity and dominating cycles
• A Size Upper Bound for Dominating Cycles
• Cycles of Length 4 or 8 in Graphs with Diameter 2 and Minimum Degree at Least 3
• A Note on Large Cycles in Graphs Around Conjectures of Bondy and Jung
• Dominating cycles and forbidden pairs containing a path of order 5