Planar-toroidal decomposition of K₁₂
From MaRDI portal
Publication:7300012
Cites work
- A large set of torus obstructions and how they were discovered
- A Maximal Toroidal Graph which is not a Triangulation.
- Acquaintance Graph Party Problem
- Bi-embeddings of graphs
- Biplanar graphs: A survey
- Current graphs and bi-embeddings
- Die toroidale Dicke des vollständigen Graphen
- Errors in graph embedding algorithms
- Every planar graph with nine points has a nonplanar complement
- Graphs of groups on surfaces. Interactions and models
- scientific article; zbMATH DE number 4135963 (Why is no real title available?)
- scientific article; zbMATH DE number 3536144 (Why is no real title available?)
- scientific article; zbMATH DE number 7196833 (Why is no real title available?)
- Infinite families of bi-embeddings
- Infinite families of biembedding numbers
- Minimal Decompositions of Complete Graphs into Subgraphs with Embeddability Properties
- Nordhaus-Gaddum results for genus
- On Chromatic Graphs
- On Sets of Acquaintances and Strangers at any Party
- On the bigenus of the complete graphs
- The Non-Biplanar Character of the Complete 9-Graph
- The Thickness of the Complete Graph
- Über eine Eigenschaft der ebenen Komplexe.
This page was built for publication: Planar-toroidal decomposition of \(K_{12}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7300012)