On the genus and connectivity of Hamiltonian graphs

DOI10.1016/0012-365X(72)90003-9MaRDI QIDQ2551470zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

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

Cited in

(7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2551470)