Cycles through prescribed vertices with large degree sum
From MaRDI portal
Publication:1901041
DOI10.1016/0012-365X(94)00036-IzbMath0838.05071OpenAlexW2151291961MaRDI QIDQ1901041
Publication date: 30 May 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(94)00036-i
Related Items (21)
A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity ⋮ A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs ⋮ A \(k\)-tree containing specified vertices ⋮ A sufficient condition for cyclability in directed graphs ⋮ An implicit degree sum condition for cycles through specified vertices ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Cycles through given vertices and closures ⋮ On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem ⋮ Disjoint cycles in hypercubes with prescribed vertices in each cycle ⋮ Long paths with endpoints in given vertex-subsets of graphs ⋮ An Implicit Degree Condition for Cyclability in Graphs ⋮ Relative length of longest paths and longest cycles in triangle-free graphs ⋮ Hamiltonicity of 4-connected graphs ⋮ Set-orderedness as a generalization of \(k\)-orderedness and cyclability ⋮ A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs ⋮ A sufficient condition for pancyclability of graphs ⋮ A new sufficient condition for pancyclability of graphs ⋮ A degree sum condition concerning the connectivity and the independence number of a graph ⋮ Degree conditions and degree bounded trees ⋮ A look at cycles containing specified elements of a graph ⋮ The maximum size of a nonhamiltonian graph with given order and connectivity
Cites Work
This page was built for publication: Cycles through prescribed vertices with large degree sum
