On cycles in 3-connected graphs

DOI10.1007/PL00007224MaRDI QIDQ1586583zbMATH OpenOpenAlexFDO

Authors 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

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

Mathematics Subject Classification ID

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

Recommendations

• Cyclability of 3-connected graphs
• On the number of cycles in 3-connected cubic graphs
• scientific article; zbMATH DE number 3929042
• Long cycles in 3-connected graphs
• Cycles in oriented 3-graphs
• scientific article; zbMATH DE number 3948309
• scientific article; zbMATH DE number 568790
• Cyclable sets of vertices in 3-connected graphs
• Longest cycles in 3-connected graphs
• Long cycles in 3-cyclable graphs

Cited in

(13)

• The k-dominating cycles in graphs
• Trivial Cycles in Graphs Embedded in 3-Manifolds
• scientific article; zbMATH DE number 5926483 (Why is no real title available?)
• Algorithm for two disjoint long paths in 2-connected graphs
• scientific article; zbMATH DE number 4079454 (Why is no real title available?)
• Cycles through 4 vertices in 3-connected graphs
• \(D_ \lambda\)-cycles in 3-cyclable graphs
• Cyclability of 3-connected graphs
• Cycles of length 2 modulo 3 in graphs
• HOW MANY n-CYCLES DOES PERIOD 3 IMPLY? AN ELEMENTARY APPROACH
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• Graphs with cyclomatic number three having panconnected square
• 3-connected graphs and their degree sequences

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1586583)