The following pages link to On a conjecture of Bondy (Q1065023):
Displaying 16 items.
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey (Q383779) (← links)
- An implicit weighted degree condition for heavy cycles (Q472135) (← links)
- Heavy cycles in \(k\)-connected weighted graphs with large weighted degree sums (Q941397) (← links)
- On degree sum conditions for long cycles and cycles through specified vertices (Q998401) (← links)
- A cycle structure theorem for Hamiltonian graphs (Q1085183) (← links)
- Longest paths joining given vertices in a graph (Q1088682) (← links)
- A sufficient condition for dominating cycles (Q1096645) (← links)
- Bridges of longest cycles (Q1262875) (← links)
- Long cycles through a linear forest (Q1850534) (← links)
- Length of longest cycles in a graph whose relative length is at least two (Q1928283) (← links)
- Degree sums and spanning brooms of a graph (Q2144512) (← links)
- A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture (Q2221920) (← links)
- Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey (Q2277468) (← links)
- Heavy cycles and spanning trees with few leaves in weighted graphs (Q2430048) (← links)
- Relative length of longest paths and cycles in 3-connected graphs (Q2746207) (← links)
- Heavy cycles in k-connected weighted graphs (Q3439170) (← links)