𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A characterization of well-covered graphs in terms of prohibited costable subgraphs

✍ Scribed by I. E. Zverovich

Book ID
110617411
Publisher
SP MAIK Nauka/Interperiodica
Year
2000
Tongue
English
Weight
301 KB
Volume
67
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Characterization of Well Covered Graph
A Characterization of Well Covered Graphs of Girth 5 or Greater
✍ A. Finbow; B. Hartnell; R.J. Nowakowski πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 998 KB

A graph is well covered if every maximal independent set has the same cardinality. A vertex \(x\), in a well covered graph \(G\), is called extendable if \(G-\{x\}\) is well covered and \(\beta(G)=\beta(G-\{x\})\). If \(G\) is a connected, well covered graph of girth \(\geqslant 5\) and \(G\) contai

A characterization of Zm-well-covered gr
A characterization of Zm-well-covered graphs of girth 6 or more
✍ Caro, Y.; Hartnell, B. πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 252 KB πŸ‘ 2 views

The class of Z m -well-covered graphs, those in which the cardinality of every maximal independent subset of vertices is congruent to the same number modulo m, contains the well-covered graphs as well as parity graphs. Here we consider such graphs, where there is no small cycle present and obtain a

A characterization of well-covered graph
A characterization of well-covered graphs that contain neither 4- nor 5-cycles
✍ A. Finbow; B. Hartnell; R. J. Nowakowski πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 434 KB πŸ‘ 1 views

## Abstract A graph is well covered if every maximal independent set has the same cardinality. A vertex __x__, in a well‐covered graph __G__, is called extendable if __G – {x}__ is well covered and Ξ²(__G__) = Ξ²(__G – {x}__). If __G__ is a connected, well‐covered graph containing no 4‐ nor 5‐cycles