Butler, 1974 - Google Patents
A generation procedure for the simple 3-polytopes with cyclically 5-connected graphsButler, 1974
View PDF- Document ID
- 15632786219476791300
- Author
- Butler J
- Publication year
- Publication venue
- Canadian Journal of Mathematics
External Links
Snippet
In this paper we derive a generation procedure for the simple (3-valent) 3-polytopes with cyclically 5-connected graphs.(A graph is called cyclically n-connected if it cannot be broken into two components, each containing a cycle, by the removal of fewer than n edges.) We …
- 238000000034 method 0 title abstract description 17
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Butler | A generation procedure for the simple 3-polytopes with cyclically 5-connected graphs | |
| Apostol | Another elementary proof of Euler's formula for ζ (2 n) | |
| SU1313362A3 (en) | Digital filter | |
| US3619586A (en) | Universal digital filter for linear discrete systems | |
| Mara | Triangulations for the cube | |
| GB1374716A (en) | Cryptographic system | |
| GB1167272A (en) | Improvement to Key Generators for Cryptographic Devices | |
| Barnette | The triangulations of the 3-sphere with up to 8 vertices | |
| Ogg | Diophantine equations and modular forms | |
| GB1496935A (en) | Adders and multipliers | |
| JPS6022767B2 (en) | binary multiplier cell circuit | |
| Ismail | The basic Bessel functions and polynomials | |
| GB1433834A (en) | Binary divider | |
| DK150875B (en) | RECURSIVE DIGITAL FILTER | |
| ES465443A1 (en) | High speed binary and binary coded decimal adder | |
| O'brien | A new comparison theorem for solutions of stochastic differential equations | |
| US3671871A (en) | Signal frequency synthesizer | |
| Barnette et al. | Hamiltonian circuits on 3-polytopes | |
| Barnette | Wv paths on 3-polytopes | |
| Yau et al. | On the design of modulo arithmetic units based on cyclic groups | |
| GB1415203A (en) | Magnetic devices | |
| GB1068077A (en) | Multiplier circuit | |
| Singh et al. | Tree structured sequential multiple-valued logic design from universal modules | |
| CA2071255A1 (en) | Arithmetic circuit | |
| Zaks | Pairs of Hamiltonian circuits in 5-connected planar graphs |