Constructing all minimum genus embeddings of

DOI10.1016/J.ENDM.2008.06.059MaRDI QIDQ5301027zbMATH OpenOpenAlexFDO

Authors Adam Weaver, M. N. Ellingham

Publication date 28 June 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2008.06.059

zbMATH Keywords

3-edge-coloringcomplete bipartite graphcubic graphminimum genus embedding

Mathematics Subject Classification ID

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

Recommendations

• On minimum-genus embeddings
• Minimum genus embeddings of the complete graph
• Strong embeddings of minimum genus
• Genus bounds for embeddings with large minimum degree and representativity
• Minimal genus embeddings in S^ 2-bundles over surfaces
• New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces
• Maximum genus and minimum genus embedding in non-orientable surfaces
• scientific article; zbMATH DE number 17568
• Maximum genus embeddings and genus embeddings on orientable surfaces
• Genus embeddings of a type of graph

Cites work

• Construction of third-order Hamiltonian graphs
• Cycle double covers and spanning minors. I
• Das Geschlecht des vollständigen paaren Graphen
• Der vollständige paare Graph auf nichtorientierbaren Flächen.
• scientific article; zbMATH DE number 978847 (Why is no real title available?)
• scientific article; zbMATH DE number 3276424 (Why is no real title available?)
• The nonorientable genus of complete tripartite graphs

Cited in

(1)

• Bi-eulerian embeddings of graphs and digraphs

This page was built for publication: Constructing all minimum genus embeddings of

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