๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs

โœ Scribed by Y. Daniel Liang; Maw-Shang Chang

Publisher
Springer-Verlag
Year
1997
Tongue
English
Weight
165 KB
Volume
34
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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