The genus of the complete tripartite graph Kmn,n,n

DOI10.1016/S0021-9800(69)80027-XzbMATH Open0186.27701OpenAlexW2080912629MaRDI QIDQ5580175FDOQ5580175

Authors: Arthur T. White 

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

zbMATH Keywords

topology

Cited In (15)

• Genus embeddings for some complete tripartite graphs
• Exceptional balanced triangulations on surfaces
• Title not available (Why is that?)
• 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
• The genus of the balanced hypercube

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)