The genus of the complete tripartite graph Kmn,n,n
From MaRDI portal
Publication:5580175
DOI10.1016/S0021-9800(69)80027-XzbMath0186.27701OpenAlexW2080912629MaRDI QIDQ5580175
Publication date: 1969
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(69)80027-x
Related Items (15)
Classes of quantum codes derived from self-dual orientable embeddings of complete multipartite graphs ⋮ The Genus of Repeated Cartesian Products of Bipartite Graphs ⋮ The genus of a type of graph ⋮ Twofold triple systems and graph imbeddings ⋮ Counterexamples to the nonorientable genus conjecture for complete tripartite graphs ⋮ Genus embeddings for some complete tripartite graphs ⋮ The nonorientable genus of complete tripartite graphs ⋮ Block designs and graph imbeddings ⋮ The genus of the balanced hypercube ⋮ Exceptional balanced triangulations on surfaces ⋮ Stronger ILPs for the Graph Genus Problem. ⋮ Sulla tracciabilita' di grafi finiti su superficie compatte ⋮ Unnamed Item ⋮ On the connectivity of graphs embedded in surfaces ⋮ Balanced subdivisions and flips on surfaces
This page was built for publication: The genus of the complete tripartite graph Kmn,n,n
