✦ LIBER ✦

Maximal Independent Subsets in Steiner Systems and in Planar Sets

✍ Scribed by Füred, Zoltán

Book ID: 118198454
Publisher: Society for Industrial and Applied Mathematics
Year: 1991
Tongue: English
Weight: 402 KB
Volume: 4
Category: Article
ISSN: 0895-4801
DOI: 10.1137/0404019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel algorithms for fractional and m

Parallel algorithms for fractional and maximal independent sets in planar graphs

✍ N. Dadoun; D.G. Kirkpatrick 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 947 KB

Maximal independent sets in bipartite gr

Maximal independent sets in bipartite graphs

✍ Jiuqiang Liu 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 458 KB 👁 1 views

## Abstract A maximal independent set of a graph __G__ is an independent set that is not contained properly in any other independent set of __G.__ In this paper, we determine the maximum number of maximal independent sets among all bipartite graphs of order __n__ and the extremal graphs as well as

Spanning sets and scattering sets in Ste

Spanning sets and scattering sets in Steiner triple systems

✍ Charles J. Colbourn; Jeffrey H. Dinitz; Douglas R. Stinson 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 737 KB

On maximal independent sets of nodes in

On maximal independent sets of nodes in trees

✍ A. Meir; J. W. Moon 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 594 KB

Convex independent sets and 7-holes in r

Convex independent sets and 7-holes in restricted planar point sets

✍ Pavel Valtr 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 955 KB

Fixed points and maximal independent set

Fixed points and maximal independent sets in AND–OR networks

✍ Julio Aracena; Jacques Demongeot; Eric Goles 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 252 KB