The cycle space of a 3-connected Hamiltonian graph

DOI10.1016/S0012-365X(99)00396-9MaRDI QIDQ1567604zbMATH OpenOpenAlexFDO

Authors Mark V. Barovich, S. C. Locke

Publication date 3 September 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(99)00396-9

zbMATH Keywords

cycle spaceHamiltonian graphs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3937201
• A basis for the cycle space of a 2-connected graph
• Cycles through 4 vertices in 3-connected graphs
• Longest cycles in 3-connected graphs
• scientific article; zbMATH DE number 1205987

Cited in

(5)

• On prisms, Möbius ladders and the cycle space of dense graphs
• 6-path-connectivity and 6-generation
• scientific article; zbMATH DE number 3937201 (Why is no real title available?)
• scientific article; zbMATH DE number 1187330 (Why is no real title available?)
• A basis for the cycle space of a 2-connected graph

This page was built for publication: The cycle space of a 3-connected Hamiltonian graph

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