๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Generating all planer graphs regular of
โœ Paolo Manca ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 225 KB ๐Ÿ‘ 1 views

## Abstract All planar connected graphs regular of degree four can be generated from the graph of the octahedron, using four operations.

Primal graphs with small degrees
โœ Phyllis Z. Chinn; R.Bruce Richter; Miroslaw Truszczynski ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 746 KB

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

Balanced graphs with minimum degree cons
โœ John Sheehan ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 464 KB

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

Regular graphs with high edge degree
โœ Alan P Sprague ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 464 KB