✦ LIBER ✦

Schedules on graphs and independent sets of graphs

✍ Scribed by A. I. Kuksa

Publisher: Springer US
Year: 1973
Tongue: English
Weight: 338 KB
Volume: 6
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01073246

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On unique independent sets in graphs

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

Independent sets, cliques and hamiltonia

Independent sets, cliques and hamiltonian graphs

✍ Xin Liu 📂 Article 📅 1995 🏛 Springer Japan 🌐 English ⚖ 471 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 feedback vertex sets and nonseparatin

On feedback vertex sets and nonseparating independent sets in cubic graphs

✍ Ewald Speckenmeyer 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 341 KB

Let G be an undirected connected graph with n nodes. A subset F of nodes of G is a feedback vertex set (fvs) if G -F is a forest and a subset J of nodes of G is a nonseparating independent set (nsis) if no two nodes of J are adjacent and G -J is connected. f(G), z ( G ) denote the cardinalities of a

Independent sets in graphs with triangle

Independent sets in graphs with triangles

✍ Thomas Hofmeister; Hanno Lefmann 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 387 KB