The genus of the complete tripartite graph Kmn,n,n
From MaRDI portal
Publication:5580175
Cited in
(15)- The genus of the balanced hypercube
- Genus embeddings for some complete tripartite graphs
- Exceptional balanced triangulations on surfaces
- scientific article; zbMATH DE number 64357 (Why is no real title available?)
- On the connectivity of graphs embedded in surfaces
- The nonorientable genus of complete tripartite graphs
- Sulla tracciabilita' di grafi finiti su superficie compatte
- Counterexamples to the nonorientable genus conjecture for complete tripartite graphs
- The Genus of Repeated Cartesian Products of Bipartite Graphs
- Stronger ILPs for the Graph Genus Problem.
- Twofold triple systems and graph imbeddings
- Block designs and graph imbeddings
- The genus of a type of graph
- Classes of quantum codes derived from self-dual orientable embeddings of complete multipartite graphs
- Balanced subdivisions and flips on surfaces
This page was built for publication: The genus of the complete tripartite graph Kmn,n,n
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5580175)