On the number of genus embeddings of complete tripartite graph.
From MaRDI portal
Publication:4909685
zbMATH Open1274.05109MaRDI QIDQ4909685FDOQ4909685
Authors: Zeling Shao, Yanpei Liu 
Publication date: 21 March 2013
Recommendations
- On the number of genus embeddings of complete bipartite graphs
- On the number of genus embeddings of complete bipartite graphs
- Genus embeddings of a type of graph
- A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs
- On the genus of the complete tripartite graph \(K_{n, n, 1}\)
Cited In (8)
- Orientable and Nonorientable Genera for Some Complete Tripartite Graphs
- Triple generations and connected components of Brauer graphs in \({M_{24}}\)
- On the genus of the complete tripartite graph \(K_{n, n, 1}\)
- On the number of genus embeddings of complete bipartite graphs
- Counterexamples to the nonorientable genus conjecture for complete tripartite graphs
- Constructing a minimum genus embedding of the complete tripartite graph \(K_{n, n, 1}\) for odd \(n\)
- Counting orientable embeddings by genus for a type of 3-regular graph
- On the number of genus embeddings of complete bipartite graphs
This page was built for publication: On the number of genus embeddings of complete tripartite graph.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909685)
