Connectivity, genus, and the number of components in vertex-deleted subgraphs

DOI10.1016/0095-8956(79)90081-9zbMath0346.05104OpenAlexW1971515859MaRDI QIDQ1233441

Edward F. Schmeichel, Gary S. Bloom

Publication date: 1979

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(79)90081-9

zbMATH Keywords

COMPONENTSCONNECTIVITYGENUSVERTEX-DELETED SUBGRAP

Mathematics Subject Classification ID

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

Related Items (7)

Maximum and minimum toughness of graphs of small genus ⋮ The complexity of recognizing tough cubic graphs ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Toughness in graphs -- a survey ⋮ 2-edge-Hamiltonian-connectedness of 4-connected plane graphs ⋮ Unnamed Item ⋮ Bounds for scattering number and rupture degree of graphs with genus

Cites Work

• Das Geschlecht des vollständigen paaren Graphen
• Hamiltonian circuits in some maps on the torus
• On the genus and connectivity of Hamiltonian graphs
• Tough graphs and Hamiltonian circuits.
• A Theorem on Planar Graphs
• Polytopes, graphs, and complexes

This page was built for publication: Connectivity, genus, and the number of components in vertex-deleted subgraphs