Heawood's theorem and connectivity

DOI10.1112/S0025579300004770MaRDI QIDQ4774061zbMATH OpenOpenAlexFDO

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
• Inequalities involving the genus of a graph and its thicknesses
• Paths and Circuits in Critical Graphs
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM

Cited in

(6)

• 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
• A compilation of relations between graph invariants
• On the connectivity of graphs embedded in surfaces
• Some results in topological graph theory

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)