The nonorientable genus of complete tripartite graphs
- 1 July 2006
- journal article
- Published by Elsevier BV in Journal of Combinatorial Theory, Series B
- Vol. 96 (4), 529-559
- https://doi.org/10.1016/j.jctb.2005.10.004
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Counterexamples to the nonorientable genus conjecture for complete tripartite graphsEuropean Journal of Combinatorics, 2005
- On the genus of joins and compositions of graphsDiscrete Mathematics, 1998
- The medial graph and voltage- current dualityDiscrete Mathematics, 1992
- Minimal ordered triangulations of surfacesJournal of Graph Theory, 1986
- The nonorientable genus of the symmetric quadripartite graphJournal of Combinatorial Theory, Series B, 1979
- Genus embeddings for some complete tripartite graphsDiscrete Mathematics, 1976
- The genus of the symmetric quadripartite graphJournal of Combinatorial Theory, Series B, 1975
- Bestimmung der Maximalzahl der Nachbargebiete auf nichtorientierbaren FlächenMathematische Annalen, 1954
- Farbensatz für orientierbare Flächen vom Geschlechte p>0.Journal für die reine und angewandte Mathematik (Crelles Journal), 1954
- Ueber das Problem der NachbargebieteMathematische Annalen, 1891