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.
| Original language | English |
|---|---|
| Pages (from-to) | 1131-1135 |
| Number of pages | 5 |
| Journal | Proceedings of the American Mathematical Society |
| Volume | 106 |
| Issue number | 4 |
| DOIs | |
| State | Published - Aug 1989 |
Keywords
- Crosscap number
- Crosscap range
- Cycle matroid
- Demigenus
- Genu
- Genus range
- Graph embedding
- Polygon matroid
Fingerprint
Dive into the research topics of 'Matroids determine the embeddability of graphs in surfaces'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver