On cycles in 3-connected graphs

DOI10.1007/PL00007224zbMath0963.05078OpenAlexW2073331154MaRDI QIDQ1586583

Hao Li

Publication date: 28 June 2001

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00007224

zbMATH Keywords

cyclecircumference3-connected graphindependent vertices\(S\)-weak-dominating

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

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

This page was built for publication: On cycles in 3-connected graphs