3 Citations
Constructing a minimum genus embedding of the complete tripartite graph Kn, n, 1 for odd n
- MathematicsDiscret. Math.
- 2019
Symmetric road interchanges
- Mathematics
- 2018
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
- Computer Science, MathematicsESA
- 2019
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
- MathematicsJ. Comb. Theory, Ser. B
- 1978
The nonorientable genus of complete tripartite graphs
- MathematicsJ. Comb. Theory, Ser. B
- 2006
Orientable and Nonorientable Genera for Some Complete Tripartite Graphs
- MathematicsSIAM J. Discret. Math.
- 2004
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
- MathematicsJ. Graph Theory
- 2014
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
- MathematicsDiscret. Math.
- 2009
Topological Graph Theory
- MathematicsHandbook of Graph Theory
- 2003
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
- Computer ScienceSODA
- 1992
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.