Pairs of edge-disjoint Hamiltonian circuits

DOI10.1007/BF01836218zbMath0331.05118OpenAlexW4238079234MaRDI QIDQ1227753

Branko Grünbaum, Joseph Malkevitch

Publication date: 1976

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/136576

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

Polyhedral graphs without Hamiltonian cycles, Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs, On regular graphs and Hamiltonian circuits, including answers to some questions of Joseph Zaks, Edge-disjoint Hamilton cycles in 4-regular planar graphs, Balanced generic circuits without long paths, Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits, Pancyclicity and NP-completeness in planar graphs, On longest cycles in essentially 4-connected planar graphs, On longest cycles in essentially 4-connected planar graphs, Twisted Groups and Locally Toroidal Regular Polytopes, Open problems on \(k\)-orbit polytopes, Partitioning the triangles of the cross polytope into surfaces, C-groups of \(\mathrm{PSL}(2,q)\) and \(\mathrm{PGL}(2,q)\)., Pairs of Hamiltonian circuits in 5-connected planar graphs, Some basic properties of multiple Hamiltonian covers, Longer cycles in essentially 4-connected planar graphs, Regular polygonal complexes in space, I, Shortness coefficient of cyclically 4-edge-connected cubic graphs, On spanning subgraphs of 4-connected planar graphs, Unnamed Item, Generating Combinatorial Complexes of Polyhedral Type, Unnamed Item, On cubic polyhedral graphs with prescribed adjacency properties of their faces, Shortness coefficient of cyclically 5-connected cubic planar graphs, Circumference of essentially 4-connected planar triangulations, The number of cycles in 2-factors of cubic graphs, Vertex-transitive graphs that have no Hamilton decomposition, Simple 3-polytopal graphs with edges of only two types and shortness coefficients

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-Hamiltonian cubic planar maps
• The existence of certain planar maps
• Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
• Shortness exponents of families of graphs
• Hamiltonian circuits in certain prisms
• A Theorem on Planar Graphs
• Polytopes, graphs, and complexes