There are planar graphs almost as good as the complete graph
β Scribed by L. Paul Chew
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 877 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract A graph is __sβregular__ if its automorphism group acts freely and transitively on the set of __s__βarcs. An infinite family of cubic 1βregular graphs was constructed in [10], as cyclic coverings of the threeβdimensional Hypercube. In this paper, we classify the __s__βregular cyclic cov
In this paper, we establish that the number of edge 3-colorings of a finite planar cubic graph G, i.e., 3-colorings of its interchange graph H, is equal to 2\*lPermanent(A)l, where N is the number of edges of G, and A is the 2N X 2iV square matrix formed by repeating each row of the N X 2N vertexdir