Cyclability of r-regular r-connected graphs
From MaRDI portal
Publication:3313894
DOI10.1017/S0004972700021213zbMath0532.05041MaRDI QIDQ3313894
No author found.
Publication date: 1984
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Related Items (6)
Circuits through prescribed vertices in k‐connected k‐regular graphs ⋮ Ordered colourings ⋮ Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs ⋮ Cycles through a prescribed vertex set in \(n\)-connected graphs. ⋮ A look at cycles containing specified elements of a graph ⋮ Are all simple 4-polytopes Hamiltonian?
Cites Work
This page was built for publication: Cyclability of r-regular r-connected graphs