✦ LIBER ✦

Balance in graph-designs

✍ Scribed by Ruini, Beatrice

Book ID: 122885502
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 153 KB
Volume: 40
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2013.05.059

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Symmetric Graph Designs

✍ H.-D.O.F. Gronau; R.C. Mullin; A. Rosa; P.J. Schellenberg 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 142 KB

Regular graph designs

✍ W.D. Wallis 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 344 KB

Archimedean graph designs

✍ Forbes, A.D.; Griggs, T.S. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 584 KB

Cycles in the block-intersection graph o

Cycles in the block-intersection graph of pairwise balanced designs

✍ Donovan R. Hare 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 580 KB

It is shown that the block-intersection graph of a pairwise balance design with ),= l is edge-pancyclic given that its minimum block cardinality is at least 3.

On balanced claw designs of complete mul

On balanced claw designs of complete multi-partite graphs

✍ Kazuhiko Ushio 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 201 KB

In this paDer,

Balanced graphs and noncovering graphs

✍ Oliver Pretzel; Dale Youngs 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 532 KB

Pretzel, 0. and D. Youngs, Balanced graphs and noncovering graphs, Discrete Mathematics, 88 (1991) 279-287. Probabilistic arguments show that triangle-free noncovering graphs are very common. Nevertheless, few specific examples are known. In this paper we describe a simple method of constructing a l