scientific article; zbMATH DE number 5777929

MaRDI QIDQ3581673zbMATH OpenFDO

Authors Michael John Grannell, Martin Knor

Publication date 2 September 2010

zbMATH Keywords

complete bipartite graphminimum genus embedding

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35)

Cited in

(3)

• Computing the orientable genus of projective graphs
• The orientable genus of the join of a cycle and a complete graph
• A lower bound for the number of orientable triangular embeddings of some complete graphs

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 Q3581673)