On relative length of longest paths and cycles

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

Kenta Ozeki, Tomoki Yamashita, Masao Tsugaki

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 cycle; longest path; relative length; 3 -connected graph

Mathematics Subject Classification ID

05C38: Paths and cycles

05C12: Distance in graphs

05C40: Connectivity

Related Items

Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey, 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, Length of longest cycles in a graph whose relative length is at least two

Cites Work

• 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
• Relative length of long paths and cycles in graphs with large degree sums
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item