On a conjecture of Bondy
From MaRDI portal
Publication:1065023
DOI10.1016/0095-8956(85)90035-8zbMath0576.05035OpenAlexW2031573311MaRDI QIDQ1065023
Publication date: 1985
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(85)90035-8
Related Items (15)
A cycle structure theorem for Hamiltonian graphs ⋮ Longest paths joining given vertices in a graph ⋮ Degree sums and spanning brooms of a graph ⋮ 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 ⋮ Heavy cycles and spanning trees with few leaves in weighted graphs ⋮ A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture ⋮ An implicit weighted degree condition for heavy cycles ⋮ Heavy cycles in \(k\)-connected weighted graphs with large weighted degree sums ⋮ Relative length of longest paths and cycles in 3-connected graphs ⋮ Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey ⋮ On degree sum conditions for long cycles and cycles through specified vertices ⋮ Bridges of longest cycles ⋮ Long cycles through a linear forest ⋮ Heavy cycles in k-connected weighted graphs
Cites Work
This page was built for publication: On a conjecture of Bondy
