Cycles through three vertices in 2-connected graphs

DOI10.1007/BF01787632MaRDI QIDQ1180435zbMATH OpenOpenAlexFDO

Authors Cun-Quan Zhang, S. C. Locke

Publication date 27 June 1992

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

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

zbMATH Keywords

minimum degreecycleHamiltonian graph2-connected graph

Mathematics Subject Classification ID

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

Recommendations

• Longest cycles in 3-connected graphs
• Cycles through 4 vertices in 3-connected graphs
• Cyclability of 3-connected graphs
• scientific article; zbMATH DE number 800446

Cites work

• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• A generalization of Dirac's theorem
• Applications of Menger's graph theorem
• Cycles and paths through specified vertices in k-connected graphs
• Graph theory with applications
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Long cycles through specified vertices in a graph
• Some Theorems on Abstract Graphs

Cited in

(8)

• Cycles and paths through specified vertices in k-connected graphs
• An existence criterion for a cycle such that the vertices not included in it are independent
• scientific article; zbMATH DE number 1990710 (Why is no real title available?)
• Cycles through 4 vertices in 3-connected graphs
• A basis for the cycle space of a 2-connected graph
• Long cycles passing through a linear forest
• Hamilton cycles in 2-connected \([5,3]\)-graphs
• Extremal 3-connected graphs

This page was built for publication: Cycles through three vertices in 2-connected graphs

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