Heawood's theorem and connectivity

DOI10.1112/S0025579300004770zbMATH Open0286.05107OpenAlexW2080961582MaRDI QIDQ4774061FDOQ4774061

Authors: R. 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)

Cites Work

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

Cited In (6)

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

This page was built for publication: Heawood's theorem and connectivity

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