𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Graphs embedded in the plane with a boun
✍ C. Paul Bonnington; R. Bruce Richter πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 138 KB πŸ‘ 1 views

## 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

Matrix Representation of Graph Embedding
✍ Y.C. Tseng; T.H. Lai; L.F. Wu πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 707 KB

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