𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Regular and irregular progressive edge-growth tanner graphs

✍ Scribed by Hu, X.-Y.; Eleftheriou, E.; Arnold, D.M.

Book ID
114638601
Publisher
IEEE
Year
2005
Tongue
English
Weight
492 KB
Volume
51
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Regular graphs and edge chromatic number
Regular graphs and edge chromatic number
✍ R.J Faudree; J Sheehan πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 376 KB

For any simple graph G, Vizing's Theorem [5] implies that A (G)~)((G)<~ A(G)+ 1, where A (G) is the maximum degree of a vertex in G and x(G) is the edge chromatic number. It is of course possible to add edges to G without changing its edge chromatic number. Any graph G is a spanning subgraph of an e

Almost regular edge colorings and regula
Almost regular edge colorings and regular decompositions of complete graphs
✍ Darryn Bryant; Barbara Maenhaut πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 127 KB

## Abstract For __k__ = 1 and __k__ = 2, we prove that the obvious necessary numerical conditions for packing __t__ pairwise edge‐disjoint __k__‐regular subgraphs of specified orders __m__~1~,__m__~2~,… ,__m__~t~ in the complete graph of order __n__ are also sufficient. To do so, we present an edge