On the genus of the complete tripartite graph Kn, n, 1

@article{Kurauskas2016OnTG,
  title={On the genus of the complete tripartite graph Kn, n, 1},
  author={Valentas Kurauskas},
  journal={Discret. Math.},
  year={2016},
  volume={340},
  pages={508-515}
}
[PDF] Semantic Reader
3 Citations
Background Citations
1

Figures from this paper

3 Citations

Constructing a minimum genus embedding of the complete tripartite graph Kn, n, 1 for odd n

Symmetric road interchanges

A road interchange where $n$ roads meet and in which the drivers are not allowed to change lanes can be modelled as an embedding of a 2-coloured (hence bipartite) multigraph $G$ with equal-sized…

Stronger ILPs for the Graph Genus Problem

This work shows how to improve the ILP formulation, and shows that instead of modeling rotation schemes explicitly, it suffices to optimize over partitions of the (bidirected) arc set A of the graph.

References

SHOWING 1-10 OF 18 REFERENCES

Orientable and nonorientable genus of the complete bipartite graph

Quadrangular embeddings of the complete even k-partite graph

Genus embeddings for some complete tripartite graphs

The nonorientable genus of complete tripartite graphs

On the genus of joins and compositions of graphs

Orientable and Nonorientable Genera for Some Complete Tripartite Graphs

Three general reduction formulas are obtained to determine the orientable and nonorientable genera for complete tripartite graphs.

Orientable Hamilton Cycle Embeddings of Complete Tripartite Graphs II: Voltage Graph Constructions and Applications

A voltage graph construction is presented for building embeddings of the complete tripartite graph on an orientable surface such that the boundary of every face is a hamilton cycle.

The orientable genus of some joins of complete graphs with large edgeless graphs

Topological Graph Theory

Introduction Voltage Graphs and Covering Spaces Surfaces and Graph Imbeddings Imbedded Voltage Graphs and Current Graphs Map Colorings The Genus of A Group References.

The Probabilistic Method

A particular set of problems - all dealing with “good” colorings of an underlying set of points relative to a given family of sets - is explored.