Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

Mobile Device Pairing
Green Open Access
Proceedings of the American Mathematical Society
Proceedings of the American Mathematical Society
ISSN 1088-6826(online) ISSN 0002-9939(print)


Matroids determine the embeddability of graphs in surfaces

Author: Thomas Zaslavsky
Journal: Proc. Amer. Math. Soc. 106 (1989), 1131-1135
MSC: Primary 05C10; Secondary 05B35
MathSciNet review: 979055
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: The embeddability of a graph in a given surface is determined entirely by the polygon matroid of the graph. That is also true for cellular embeddability in nonorientable surfaces but not in orientable surfaces.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 05C10, 05B35

Retrieve articles in all journals with MSC: 05C10, 05B35

Additional Information

PII: S 0002-9939(1989)0979055-7
Keywords: Primary, graph embedding, genus, demigenus, crosscap number, genus range, crosscap range, Secondary, polygon matroid, cycle matroid
Article copyright: © Copyright 1989 American Mathematical Society