Euler's formula for general graph embeddings

DOI10.1007/978-3-031-83864-4_14MaRDI QIDQ7236440zbMATH OpenFDO

Authors D. Bauer, Linda Lesniak, E. Schmeichel

Publication date 29 April 2026

Full work available at URL https://doi.org/10.1007/978-3-031-83864-4_14

zbMATH Keywords

2-cell embeddingsEuler's formulagraph embeddings

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites work

• A Six Color Problem
• scientific article; zbMATH DE number 2131198 (Why is no real title available?)
• scientific article; zbMATH DE number 3877215 (Why is no real title available?)
• scientific article; zbMATH DE number 3179262 (Why is no real title available?)
• scientific article; zbMATH DE number 3579615 (Why is no real title available?)
• scientific article; zbMATH DE number 3246034 (Why is no real title available?)
• The Flaw in Euler's Proof of His Polyhedral Formula
• The non-orientable genus of the n-cube
• The nonorientable genus of 𝐾_{𝑛}

This page was built for publication: Euler's formula for general graph embeddings

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