Relative length of long paths and cycles in graphs with large degree sums
From MaRDI portal
Publication:4852406
DOI10.1002/jgt.3190200210zbMath0841.05057OpenAlexW2030901739MaRDI QIDQ4852406
Hikoe Enomoto, Akira Saito, Atsushi Kaneko, Jan van den Heuvel
Publication date: 14 July 1996
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://research.utwente.nl/en/publications/relative-length-of-long-paths-and-cycles-in-graphs-with-large-degree-sums(4085b3f1-01df-4e1a-9324-9abe9780b5cf).html
Related Items (18)
An implicit degree condition for relative length of long paths and cycles in graphs ⋮ Characterizing forbidden pairs for relative length of longest paths and cycles ⋮ Degree sums and spanning brooms of a graph ⋮ Relative length of longest paths and cycles in graphs ⋮ 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 ⋮ Degree conditions and relative length of longest paths and cycles in graphs ⋮ Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path ⋮ Proper connection of graphs ⋮ Degree sums and dominating cycles ⋮ Relative length of longest paths and longest cycles in triangle-free graphs ⋮ Relative length of longest paths and cycles in 3-connected graphs ⋮ A note on a cycle partition problem ⋮ A degree sum condition for graphs to be covered by two cycles ⋮ Long cycles in graphs without Hamiltonian paths ⋮ On relative length of longest paths and cycles ⋮ A degree sum condition for graphs to be prism Hamiltonian ⋮ A degree sum condition with connectivity for relative length of longest paths and cycles
Cites Work
This page was built for publication: Relative length of long paths and cycles in graphs with large degree sums
