Title
On The Orientable Genus Of The Cartesian Product Of A Complete Regular Tripartite Graph With An Even Cycle
Abstract
We apply the technique of patchwork embeddings to find orientable genus embeddings of the Cartesian product of a complete regular tripartite graph with a even cycle. In particular, the orientable genus of Km,m,m x C-2n is determined for m greater than or equal to 1 and for all n greater than or equal to 3 and n = 1. For n = 2 both lower and upper bounds are given. We see that the resulting embeddings may have a mixture of triangular and quadrilateral faces, in contrast to previous applications of the patchwork method.
Year
Venue
Field
2004
ARS COMBINATORIA
Discrete mathematics,Graph,Combinatorics,Cartesian product,Genus (mathematics),Mathematics
DocType
Volume
ISSN
Journal
70
0381-7032
Citations 
PageRank 
References 
1
0.37
0
Authors
2
Name
Order
Citations
PageRank
C. Paul Bonnington110019.95
Tomaz Pisanski28219.67