✦ LIBER ✦

Independent sets in graphs with triangles

✍ Scribed by Thomas Hofmeister; Hanno Lefmann

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 387 KB
Volume: 58
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(96)00072-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Triangles and Neighbourhoods of Independ

Triangles and Neighbourhoods of Independent Sets in Graphs

✍ Andrew M. Robertshaw; Douglas R. Woodall 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 124 KB

It is proved that a graph of order n contains a triangle if |N(X )| > 1 3 (n+|X |) for every independent set X of vertices. This bound is sharp.

Graphs with unique maximum independent s

Graphs with unique maximum independent sets

✍ Glenn Hopkins; William Staton 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 402 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

Independent sets in random sparse graphs

✍ Pedro G. Gazmuri 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB

On unique independent sets in graphs

✍ Werner Siemes; Jerzy Topp; Lutz Volkmann 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 483 KB

Independent Sets in Circular-Arc Graphs

✍ W.L. Hsu; J.P. Spinrad 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 755 KB