scientific article; zbMATH DE number 913548

MaRDI QIDQ4887820zbMATH OpenFDO

Authors Jorma Kyppö

Publication date 7 November 1996

zbMATH Keywords

closed surfacescomplete graphsembeddingsgenusHeawood numbermap color theorem

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)
• Exponentially many maximum genus embeddings and genus embeddings for complete graphs
• Minimum genus embeddings of the complete graph
• The genus of complete 3-uniform hypergraphs
• Maximum genus embeddings and genus embeddings on orientable surfaces

Cited in

(4)

• Maximum genus of a graph in terms of its embedding properties.
• The genus of complete 3-uniform hypergraphs
• Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)
• scientific article; zbMATH DE number 3946159 (Why is no real title available?)

This page was built for publication:

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