On cycles in 3-connected graphs
From MaRDI portal
Publication:1586583
DOI10.1007/PL00007224zbMath0963.05078MaRDI QIDQ1586583
Publication date: 28 June 2001
Published in: Graphs and Combinatorics (Search for Journal in Brave)
05C38: Paths and cycles
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey, The \(k\)-dominating cycles in graphs, Algorithm for two disjoint long paths in 2-connected graphs