Cyclability of r-regular r-connected graphs
From MaRDI portal
Publication:3313894
DOI10.1017/S0004972700021213zbMATH Open0532.05041MaRDI QIDQ3313894FDOQ3313894
Authors:
Publication date: 1984
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (7)
- Circuits through prescribed vertices in k‐connected k‐regular graphs
- Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs
- Title not available (Why is that?)
- A look at cycles containing specified elements of a graph
- Ordered colourings
- Cycles through a prescribed vertex set in \(n\)-connected 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)