Cyclability of 3-connected graphs
From MaRDI portal
Publication:4500706
DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0118(200007)34:3<191::AID-JGT1>3.0.CO;2-V" /><191::AID-JGT1>3.0.CO;2-V 10.1002/1097-0118(200007)34:3<191::AID-JGT1>3.0.CO;2-VzbMath0955.05060OpenAlexW4237487695MaRDI QIDQ4500706
Hao Li, Feng Tian, Amel Harkat-Benhamdine
Publication date: 12 February 2001
Full work available at URL: https://doi.org/10.1002/1097-0118(200007)34:3<191::aid-jgt1>3.0.co;2-v
Related Items (11)
A \(k\)-tree containing specified vertices ⋮ Edge bounds in nonhamiltonian \(k\)-connected graphs ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem ⋮ Disjoint cycles in hypercubes with prescribed vertices in each cycle ⋮ The \(k\)-dominating cycles in graphs ⋮ Hamiltonicity of 4-connected graphs ⋮ Set-orderedness as a generalization of \(k\)-orderedness and cyclability ⋮ A degree sum condition concerning the connectivity and the independence number of a graph ⋮ A look at cycles containing specified elements of a graph
Cites Work
This page was built for publication: Cyclability of 3-connected graphs
