On the genus and connectivity of Hamiltonian graphs

DOI10.1016/0012-365X(72)90003-9zbMath0234.05103OpenAlexW2034565165MaRDI QIDQ2551470

Richard A. Duke

Publication date: 1972

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(72)90003-9

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (7)

Unnamed Item ⋮ On 2-connected spanning subgraphs with low maximum degree ⋮ Connectivity, genus, and the number of components in vertex-deleted subgraphs ⋮ Contractible Hamiltonian cycles in triangulated surfaces ⋮ Hamiltonian circuits in some maps on the torus ⋮ Bounds for scattering number and rupture degree of graphs with genus ⋮ Disjoint paths, planarizing cycles, and spanning walks

Cites Work

• Das Geschlecht des vollständigen paaren Graphen
• Hamiltonian circuits in some maps on the torus
• A Theorem on Planar Graphs
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• On a graph theorem by dirac
• Polytopes, graphs, and complexes
• Some Theorems on Abstract Graphs

This page was built for publication: On the genus and connectivity of Hamiltonian graphs