Relative length of longest paths and longest cycles in triangle-free graphs

DOI10.1016/j.disc.2007.03.070zbMath1134.05042OpenAlexW2051831839MaRDI QIDQ2470001

Daniël Paulusma, Kiyoshi Yoshimoto

Publication date: 11 February 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/7425/1/7425.pdf

zbMATH Keywords

cycletriangle-free graphOre conditionrelative length

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycles through specified vertices
• Existence of Dlambda-cycles and Dlambda-paths
• Longest cycles in triangle-free graphs
• Cycles and paths through specified vertices in k-connected graphs
• Relative lengths of paths and cycles in k-connected graphs
• Cycles through specified vertices of a graph
• Long cycles through specified vertices in a graph
• Cycles through subsets with large degree sums
• Advances on the Hamiltonian problem -- a survey
• Hamilton cycles in 1-tough triangle-free graphs
• Long cycles in triangle-free graphs with prescribed independence number and connectivity
• On paths and cycles through specified vertices
• Cycles through prescribed vertices with large degree sum
• Edge degrees and dominating cycles
• Relative length of longest paths and cycles in 3-connected graphs
• Note on Hamilton Circuits
• Long paths, long cycles, and their relative length
• Relative length of long paths and cycles in graphs with large degree sums
• 2-factors in triangle-free graphs