𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Color symmetry and colored polyhedra

✍ Scribed by Senechal, M.


Book ID
114512465
Publisher
International Union of Crystallography
Year
1983
Tongue
English
Weight
768 KB
Volume
39
Category
Article
ISSN
0108-7673

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Map coloring, polyhedra, and the four-co
✍ David Barnette πŸ“‚ Library πŸ“… 1983 πŸ› Mathematical Association of America 🌐 English βš– 1 MB

In the summer of 1976 Kenneth Appel and Wolfgang Haken of the University of Illinois announced that they had solved the Four-Color Problem. Suddenly what had been known to several generations of mathematicians as the Four-Color Conjecture had become the Four-Color Theorem.Since it had been a conject

Proportional colored symmetry
✍ Jablan, S. V. πŸ“‚ Article πŸ“… 1994 πŸ› International Union of Crystallography 🌐 English βš– 348 KB
Local color symmetry
✍ Richard L. Roth πŸ“‚ Article πŸ“… 1984 πŸ› Springer 🌐 English βš– 473 KB
Graphical and color-pairing symmetries
✍ D. J. Klein; T. P. Ε½ivkoviΔ‡ πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 620 KB

## Abstract Symmetries are considered for a class of Hamiltonian models with one (spin‐free) orbital per site. The models include common types of Parisier‐Parr‐Pople and valence‐bond Hamiltonians, defined over a continuous range of parametrizations. The symmetries investigated are linear canonical

Coloring the Faces of Convex Polyhedra s
✍ Daniel P. Sanders; Yue Zhao πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 112 KB

This paper proves the conjecture of Horn ˘a ´k and Jendrol' that the faces of a convex polyhedron with maximum vertex degree D can be colored with 1+(D+7)(D -1) d colors in such a way that each pair of faces that are distance at most d apart receives different colors. © 2002 Elsevier Science (USA) b