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

DOI10.1016/0095-8956(79)90081-9MaRDI QIDQ1233441zbMATH OpenOpenAlexFDO

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

Cites work

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

Cited in

(7)

• Toughness in graphs -- a survey
• scientific article; zbMATH DE number 2230266 (Why is no real title available?)
• Bounds for scattering number and rupture degree of graphs with genus
• The complexity of recognizing tough cubic graphs
• 2-edge-Hamiltonian-connectedness of 4-connected plane graphs
• Maximum and minimum toughness of graphs of small genus
• Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey

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

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