Cyclability of r-regular r-connected graphs

DOI10.1017/S0004972700021213MaRDI QIDQ3313894zbMATH OpenFDO

Authors

Publication date 1984

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0004972700021213

zbMATH Keywords

cyclabilityMeridith graphs

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 4081595
• scientific article; zbMATH DE number 4014757
• scientific article; zbMATH DE number 867634
• scientific article; zbMATH DE number 4177104
• Circumference of a regular graph

Cites work

• A nine point theorem for 3-connected graphs
• A shortness exponent forr-regularr-connected graphs
• Graph theory with applications
• Regular n-valent n-connected non-Hamiltonian non n-edge-colourable graphs
• When m vertices in a k-connected graph cannot be walked round along a simple cycle

Cited in

(7)

• A look at cycles containing specified elements of a graph
• Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs
• Cycles through a prescribed vertex set in \(n\)-connected graphs.
• Ordered colourings
• scientific article; zbMATH DE number 4014757 (Why is no real title available?)
• Circuits through prescribed vertices in k‐connected k‐regular graphs
• Are all simple 4-polytopes Hamiltonian?

This page was built for publication: Cyclability of r-regular r-connected graphs

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