Euclidean spanner graphs with degree four
โ Scribed by Jeffrey S. Salowe
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 826 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract All planar connected graphs regular of degree four can be generated from the graph of the octahedron, using four operations.
## It has previously been shown that there is a unique set Il of primal graphs such that every graph has an edge-decomposition into non-isomorphic elements of 17 and that the only decomposition of an element of II into non-isomorphic elements of II is the obvious one. Here it is shown that there a
Sheehan, J., Balanced graphs with minimum degree constraints, Discrete Mathematics 102 (1992) 307-314. Let G be a finite simple graph on n vertices with minimum degree 6 = 6(G) (n = 6 (mod 2)). Suppose that 0 < 6 c n -2, 06 i 4 [?Sl. A partition (x, Y) of V(G) is said to be an (i, a)-partition of G