A note on a degree sum condition for long cycles in graphs

2007/11/28 by Janusz Adamus, Adamus, Janusz
Computer Science · Mathematics · #05C38 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.0711.4394

openalex publication_date 2007/11/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We conjecture that a 2-connected graph G of order n, in which d(x)+d(y)≥ n-k for every pair of non-adjacent vertices x and y, contains a cycle of length n-k (k

Citations

• Some Theorems on Abstract Graphs

Related

• Relative Length of Long Paths and Cycles in Graphs
• Longest Cycle above Erdős-Gallai Bound
• A unified proof of conjectures on cycle lengths in graphs
• On degree sum conditions for 2-factors with a prescribed number of cycles
• A note on finding long directed cycles above the minimum degree bound in 2-connected digraphs