Embedding a graph in a plane with certain constraints
β Scribed by W. Engl; D. Mlynski
- Book ID
- 126604479
- Publisher
- Institute of Electrical and Electronics Engineers
- Year
- 1970
- Tongue
- English
- Weight
- 417 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0018-9324
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Halin's Theorem characterizes those infinite connected graphs that have an embedding in the plane with no accumulation points, by exhibiting the list of excluded subgraphs. We generalize this by obtaining a similar characterization of which infinite connected graphs have an embedding in
The purpose of this paper is to demonstrate the use of matrices for the representation of graph embedding in a hypercube. We denote the image of an embedding (which is a subgraph of the hypercube) as a matrix. With this representation, we are able to simplify, unify, generalize, or improve existing