𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the toroidal thickness of graphs

✍ Scribed by Ian Anderson

Publisher
John Wiley and Sons
Year
1982
Tongue
English
Weight
297 KB
Volume
6
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Choosability of toroidal graphs without
Choosability of toroidal graphs without short cycles
✍ Leizhen Cai; Weifan Wang; Xuding Zhu πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 142 KB πŸ‘ 1 views

## Abstract Let __G__ be a toroidal graph without cycles of a fixed length __k__, and Ο‡~__l__~(__G__) the list chromatic number of __G__. We establish tight upper bounds of Ο‡~__l__~(__G__) for the following values of __k__: Β© 2009 Wiley Periodicals, Inc. J Graph Theory 65: 1–15, 2010.

Polynomial-Time Analysis of Toroidal Per
Polynomial-Time Analysis of Toroidal Periodic Graphs
✍ F. HΓΆfting; E. Wanke πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 177 KB

A toroidal periodic graph G D is defined by an integral d = d matrix D and a directed graph G in which the edges are associated with d-dimensional integral vectors. The periodic graph has a vertex for each vertex of the static graph and for each integral position in the parallelpiped defined by the

Classification of the toroidal groups
Classification of the toroidal groups
✍ Viera KrnΜ†anovΓ‘ Proulx πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 226 KB
On the hamiltonian path graph of a graph
On the hamiltonian path graph of a graph
✍ George R. T. Hendry πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 491 KB πŸ‘ 1 views

The hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and u are adjacent if and only if F contains a hamiltonian u -u path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian grap