Length of longest cycles in a graph whose relative length is at least two

DOI10.1007/s00373-011-1078-2zbMath1256.05126OpenAlexW2071976572MaRDI QIDQ1928283

Kenta Ozeki, Tomoki Yamashita

Publication date: 3 January 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1078-2

zbMATH Keywords

circumferencedegree sumrelative length

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40) Vertex degrees (05C07)

Related Items (2)

Spanning paths in graphs ⋮ Spanning paths and cycles in triangle-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a conjecture of Bondy
• The longest cycles in a graph G with minimum degree at least \(| G| /k\)
• Relative lengths of paths and cycles in 3-connected graphs
• A lower bound for the circumference of a graph
• Lower bounds of length of longest cycles in graphs involving neighborhood unions
• Long cycles in graphs with prescribed toughness and minimum degree
• Relative length of longest paths and cycles in 3-connected graphs
• On relative length of longest paths and cycles
• Extremal problems involving neighborhood unions
• Circumference and girth
• Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
• Long paths, long cycles, and their relative length
• Longest cycles in tough graphs
• Relative length of long paths and cycles in graphs with large degree sums
• On a graph theorem by dirac
• Some Theorems on Abstract Graphs

This page was built for publication: Length of longest cycles in a graph whose relative length is at least two