𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Explicit constructions of graphs without short cycles and low density codes

✍ Scribed by G. A. Margulis

Book ID
110564330
Publisher
Springer-Verlag
Year
1982
Tongue
English
Weight
364 KB
Volume
2
Category
Article
ISSN
0209-9683

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.

Vertex colorings of graphs without short
Vertex colorings of graphs without short odd cycles
✍ Andrzej Dudek; Reshma Ramadurai πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 118 KB πŸ‘ 1 views

Motivated by the work of NeΕ‘etΕ™il and R ΓΆdl on "Partitions of vertices" we are interested in obtaining some quantitative extensions of their result. In particular, given a natural number r and a graph G of order m with odd girth g, we show the existence of a graph H with odd girth at least g and ord