Heawood's theorem and connectivity

DOI10.1112/S0025579300004770zbMath0286.05107OpenAlexW2080961582MaRDI QIDQ4774061

Roger J. Cook

Publication date: 1973

Published in: Mathematika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/s0025579300004770

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

A compilation of relations between graph invariants, Matching extension and the genus of a graph, Connectivity and \(W_v\)-paths in polyhedral maps on surfaces, The (\(n\), \(k\))-extendable graphs in surfaces, Some results in topological graph theory, On the connectivity of graphs embedded in surfaces

Cites Work

• Congruent Graphs and the Connectivity of Graphs
• Inequalities involving the genus of a graph and its thicknesses
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• Paths and Circuits in Critical Graphs