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

DOI10.1007/S00373-011-1078-2MaRDI QIDQ1928283zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Long paths, long cycles, and their relative length
• A degree sum condition with connectivity for relative length of longest paths and cycles
• Relative length of longest paths and cycles in 3-connected graphs
• On relative length of longest paths and cycles
• Relative length of long paths and cycles in graphs with large degree sums

Cites work

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

Cited in

(22)

• A degree sum condition with connectivity for relative length of longest paths and cycles
• Spanning paths in graphs
• Long cycles in 3-cyclable graphs
• Circumference of a graph and its distance dominating longest cycles
• Relative length of longest paths and longest cycles in triangle-free graphs
• The circumference of a class of 3-connected graphs
• scientific article; zbMATH DE number 4162913 (Why is no real title available?)
• Relative length of longest paths and cycles in 2-connected graphs
• On relative length of longest paths and cycles
• Advanced lower bounds for the circumference
• scientific article; zbMATH DE number 3908470 (Why is no real title available?)
• scientific article; zbMATH DE number 26309 (Why is no real title available?)
• Long paths, long cycles, and their relative length
• scientific article; zbMATH DE number 568790 (Why is no real title available?)
• Degree sums for edges and cycle lengths in graphs
• Relative length of long paths and cycles in graphs with large degree sums
• Spanning paths and cycles in triangle-free graphs
• Degree bounds for the circumference of 3‐connected graphs
• Relationships between the length of a longest path and the relative length
• Degree conditions and relative length of longest paths and cycles in graphs
• A bound on relative lengths of triangle-free graphs
• Estimating the circumference of a graph in terms of its leaf number

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928283)