Cyclable sets of vertices in 3-connected graphs

DOI10.4310/JOC.2016.v7.n2.a14zbMath1336.05075OpenAlexW2720669560MaRDI QIDQ286770

Yan Zhu, Hao Li

Publication date: 25 May 2016

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/joc.2016.v7.n2.a14

zbMATH Keywords

Hamiltonian graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Degree sum conditions on two disjoint cycles in graphs ⋮ Longest cycles in 4-connected graphs ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Spanning trees with a bounded number of leaves

This page was built for publication: Cyclable sets of vertices in 3-connected graphs