Quotients of complete graphs: revisiting the Heawood map-coloring problem

DOI10.2140/pjm.1974.55.391zbMath0306.55001OpenAlexW1990157800MaRDI QIDQ1217555

Jonathan L. Gross, Thomas W. Tucker

Publication date: 1974

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1974.55.391

Mathematics Subject Classification ID

Covering spaces and low-dimensional topology (57M10) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)

Related Items (21)

Classification of the toroidal groups ⋮ Dual imbeddings and wrapped quasi-coverings of graphs ⋮ Signatures, Lifts, and Eigenvalues of Graphs ⋮ Curvature and Higher Order Buser Inequalities for the Graph Connection Laplacian ⋮ Algebraic specification of interconnection network relationships by permutation voltage graph mappings ⋮ The topological theory of current graphs ⋮ Genus embeddings for some complete tripartite graphs ⋮ A duality theorem for graph embeddings ⋮ Block designs and graph imbeddings ⋮ Embeddings of covering projections of graphs ⋮ Every connected regular graph of even degree is a Schreier coset graph ⋮ Generating all graph coverings by permutation voltage assignments ⋮ Circulant graph imbeddings ⋮ Self-dual embeddings of Cayley graphs ⋮ Voltage graph embeddings and the associated block designs ⋮ The embeddings of a graph—A survey ⋮ An infinite family of octahedral crossing numbers ⋮ Nonorientable genus of cartesian products of regular graphs ⋮ Characteristic polynomials of digraphs having a semi-free action ⋮ Voltage graphs ⋮ Quotients of connected regular graphs of even degree

This page was built for publication: Quotients of complete graphs: revisiting the Heawood map-coloring problem