𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hitting All Maximal Independent Sets of a Bipartite Graph

✍ Scribed by Cardinal, Jean; Joret, Gwenaël

Book ID
125348008
Publisher
Springer
Year
2014
Tongue
English
Weight
485 KB
Volume
72
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The number of maximal independent sets i
The number of maximal independent sets in a connected graph
✍ Jerrold R. Griggs; Charles M. Grinstead; David R. Guichard 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 1021 KB

We determine the maximum on n vertices can have, and we a question of Wilf. number of maximal independent sets which a connected graph completely characterize the extremal graphs, thereby answering \* Partially supported by NSF grant number DIMS-8401281. t Partially supported by NSF grant number D S

Bipartite graphs can have any number of
Bipartite graphs can have any number of independent sets
✍ V. Linek 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 476 KB

In this paper we prove that for every positive integer n there exists a bipartite graph with exactly n independent sets.