✦ LIBER ✦

A remark on covering graphs

✍ Scribed by Pavel Holub

Publisher: Springer Netherlands
Year: 1985
Tongue: English
Weight: 111 KB
Volume: 2
Category: Article
ISSN: 0167-8094
DOI: 10.1007/bf00333136

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A remark on covering blocks

✍ Reinhard Kno¨rr 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 152 KB

A remark on embedded bipartite graphs

✍ Gadi Moran 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 116 KB

Antipodal covering graphs

✍ A Gardiner 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 937 KB

Mixed covering arrays on graphs

✍ Karen Meagher; Lucia Moura; Latifa Zekaoui 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB

## Abstract Covering arrays have applications in software, network and circuit testing. In this article, we consider a generalization of covering arrays that allows mixed alphabet sizes as well as a graph structure that specifies the pairwise interactions that need to be tested. Let __k__ and __n__

A remark on maximum matching of line gra

A remark on maximum matching of line graphs

✍ Shuji Shiraishi 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 116 KB

Remark on the graphs with a central symm

Remark on the graphs with a central symmetry

✍ Ferdinand Glivjak; Anton Kotzig; Ján Plesnik 📂 Article 📅 1970 🏛 Springer Vienna 🌐 English ⚖ 245 KB