A characterization of planar graphs by trémaux orders
✍ Scribed by H. de Fraysseix; P. Rosenstiehl
- Book ID
- 110564419
- Publisher
- Springer-Verlag
- Year
- 1985
- Tongue
- English
- Weight
- 364 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract A cycle in a graph is a set of edges that covers each vertex an even number of times. A cocycle is a collection of edges that intersects each cycle in an even number of edges. A bicycle is a collection of edges that is both a cycle and a cocycle. The cycles, cocycles, and bicycles each
## Abstract We give a detailed algebraic characterization of when a graph __G__ can be imbedded in the projective plane. The characterization is in terms of the existence of a dual graph __G__\* on the same edge set as __G__, which satisfies algebraic conditions inspired by homology groups and inte