𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms for Maximum Independent Set in Convex Bipartite Graphs

✍ Scribed by José Soares; Marco A. Stefanes

Publisher
Springer
Year
2007
Tongue
English
Weight
371 KB
Volume
53
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

Neighborhood conditions for balanced ind
Neighborhood conditions for balanced independent sets in bipartite graphs
✍ Denise Amar; Stephan Brandt; Daniel Brito; Oscar Ordaz 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 319 KB

Let G be a balanced bipartite graph of order 2n and minimum degree 6(G)>~3. If, for every balanced independent set S of four vertices, IN(S)I >n then G is traceable, the circumference is at least 2n -2 and G contains a 2-factor (with only small order exceptional graphs for the latter statement). If