Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs
From MaRDI portal
(Redirected from Publication:1124606)
Recommendations
- Addendum to the article: Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs
- On certain Hamiltonian cycles in planar graphs
- Hamiltonian cycles and 1-factors in 5-regular graphs
- On Hamiltonian cycles in 4- and 5-connected plane triangulations
- scientific article; zbMATH DE number 4152401
Cites work
- scientific article; zbMATH DE number 3346377 (Why is no real title available?)
- A Theorem on Planar Graphs
- Cyclability of r-regular r-connected graphs
- Cycles Hamiltoniens dans les graphes 4-réguliers 4-connexes
- Hamiltonian circuits in certain prisms
- Non-Hamiltonian cubic planar maps
- Pairs of edge-disjoint Hamiltonian circuits
- Polytopes, graphs, and complexes
- Regular n-valent n-connected non-Hamiltonian non n-edge-colourable graphs
- The existence of certain planar maps
Cited in
(6)- scientific article; zbMATH DE number 4152401 (Why is no real title available?)
- Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits
- On the circumference of essentially 4-connected planar graphs
- Regular n-valent n-connected non-Hamiltonian non n-edge-colourable graphs
- Hamiltonian cycles and 1-factors in 5-regular graphs
- Addendum to the article: Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs
This page was built for publication: Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124606)
