On relative length of longest paths and cycles

DOI10.1002/jgt.20403zbMath1229.05183OpenAlexW4233653240MaRDI QIDQ3652557

Tomoki Yamashita, Masao Tsugaki, Kenta Ozeki

Publication date: 18 December 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20403

zbMATH Keywords

longest cyclelongest pathrelative length3 -connected graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40)

Related Items (6)

Characterizing forbidden pairs for relative length of longest paths and cycles ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Length of longest cycles in a graph whose relative length is at least two ⋮ Proper connection of graphs ⋮ Long cycles in graphs without Hamiltonian paths ⋮ A degree sum condition with connectivity for relative length of longest paths and cycles

Cites Work

• Unnamed Item
• Long cycles in graphs without Hamiltonian paths
• Relative lengths of paths and cycles in 3-connected graphs
• Relative lengths of paths and cycles in k-connected graphs
• Longest paths and longest cycles in graphs with large degree sums
• Relative length of longest paths and cycles in graphs
• Relative length of longest paths and cycles in 3-connected graphs
• Note on Hamilton Circuits
• Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
• Long paths, long cycles, and their relative length
• Relative length of long paths and cycles in graphs with large degree sums
• Some Theorems on Abstract Graphs

This page was built for publication: On relative length of longest paths and cycles