Orientable and Nonorientable Genera for Some Complete Tripartite Graphs

Ken‐ichi Kawarabayashi, Chris Stephens, Xiaoya Zha

SIAM Journal on Discrete Mathematics · 2004 · 13 citations · 6 references

Concepts

Abstract

In this paper, we obtain three general reduction formulas to determine the orientable and nonorientable genera for complete tripartite graphs. As corollaries, we (1) reduce the determination of the orientable (nonorientable, respectively) genera of 75 percent (85 percent, respectively) of nonsymmetric (with respect to l,m, and n) Kl,m,n to that of Km,m,n, and (2) determine the orientable and nonorientable genera for several classes of complete tripartite graphs.

References

6