𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Crystallographic nets and their quotient graphs

✍ Scribed by W. E. Klee

Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
151 KB
Volume
39
Category
Article
ISSN
0232-1300

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Nets and their codes
Nets and their codes
✍ Steven Dougherty πŸ“‚ Article πŸ“… 1993 πŸ› Springer 🌐 English βš– 894 KB
Infinite paths in planar graphs I: Graph
Infinite paths in planar graphs I: Graphs with radial nets
✍ Xingxing Yu πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 234 KB πŸ‘ 1 views

## Abstract Let __G__ be an infinite 4‐connected planar graph such that the deletion of any finite set of vertices from __G__ results in exactly one infinite component. Dean __et al__. proved that either __G__ admits a radial net or a special subgraph of __G__ admits a ladder net, and they used the

Infinite paths in planar graphs II, stru
Infinite paths in planar graphs II, structures and ladder nets
✍ Xingxing Yu πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 217 KB πŸ‘ 1 views

## Abstract A graph is __k‐indivisible__, where __k__ is a positive integer, if the deletion of any finite set of vertices results in at most __k__ – 1 infinite components. In 1971, Nash‐Williams conjectured that a 4‐connected infinite planar graph contains a spanning 2‐way infinite path if and onl