A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A remark on embedded bipartite graphs
1987
Journal of combinatorial theory. Series B (Print)
A use of Euler's formula in Zaks (J. Combin. Theory Ser. B 32 (1982), 95-98 ) is replaced by an elementary argument on permutations. 0 1987 Academic Press, Inc Let 5' be an orientable compact surface, and let G be a finite bipartite graph with u vertices, 2-cell embedded in S. Let m denote the number of 4k-gonal faces (k = 1, 2, 3,...) of this embedding (a face is a connected component of the complement of the graph G in S; G is 2-cell embedded means that every face is homeomorphic to an open
doi:10.1016/0095-8956(87)90023-2
fatcat:pnuqdaflvzfsrokji2jbr5wauu