Optimal Orientations of Graphs and Digraphs: A Survey
β Scribed by K.M. Koh; E.G. Tay
- Publisher
- Springer Japan
- Year
- 2002
- Tongue
- English
- Weight
- 132 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Cayley graphs arise naturally in computer science, in the study of word-hyperbolic groups and automatic groups, in change-ringing, in creating Escher-like repeating patterns in the hyperbolic plane, and in combinatorial designs. Moreover, Babai has shown that all graphs can be realized as an induced
We have recently completed the computer generation of a catalogue of all the 12,(b05,168 unlabelled graphs on 10 vertices, and are willing to make this catalogue available to those interested. The catalogue consists of two magnetic tapes; one contains all ten-vertex graphs on up to 20 edges, the ot