The combinatorial map color theorem

DOI10.1002/JGT.3190010210MaRDI QIDQ4166773zbMATH OpenOpenAlexFDO

Authors Gerhard Ringel

Publication date 1977

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190010210

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites work

• On the maximum genus of a graph

Cited in

(15)

• Embeddings of infinite graphs
• An algorithm for imbedding cubic graphs in the torus
• Characterization of the maximum genus of a signed graph
• Characterization of signed graphs which are cellularly embeddable in no more than one surface
• An obstruction to embedding graphs in surfaces
• Signed analogs of bipartite graphs
• The smallest surface that contains all signed graphs on \(K_{4, n}\)
• On 2-cell embeddings of graphs with minimum numbers of regions
• scientific article; zbMATH DE number 4047749 (Why is no real title available?)
• scientific article; zbMATH DE number 495474 (Why is no real title available?)
• Upper bounds on the bondage number of a graph
• Full-edge friendly index sets of fan
• Exponential families of nonisomorphic nonorientable genus embeddings of complete graphs
• The maximum partial-dual genus of a ribbon graph
• Bi-eulerian embeddings of graphs and digraphs

This page was built for publication: The combinatorial map color theorem

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