Abstract
We show that every 3-connected planar graph has a circular embedding in some nonspherical surface. More generally, we characterize those planar graphs that have a 2-representative embedding in some nonspherical surface.
Original language | English (US) |
---|---|
Pages (from-to) | 273-280 |
Number of pages | 8 |
Journal | Discrete Mathematics |
Volume | 126 |
Issue number | 1-3 |
DOIs | |
State | Published - Mar 1 1994 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics