Abstract
The natural extension of MacLane's combinatorial approach to planar imbeddings is seen to yield a combinatorial formulation of imbedding of a graph in a pseudosurface. This leads to a combinatorially defined parameter for all graphs, called the imbedding index. A generalization of the Heaword inequality is then proved for this parameter.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 151-159 |
| Number of pages | 9 |
| Journal | Journal of Combinatorial Theory, Series B |
| Volume | 27 |
| Issue number | 2 |
| DOIs | |
| State | Published - Oct 1979 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics