𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Well-located graphs: A collection of well-covered ones

✍ Scribed by A.S. Finbow; B.L. Hartnell

Book ID
108498118
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
135 KB
Volume
5
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Well-Covered Vector Spaces of Graphs
Well-Covered Vector Spaces of Graphs
✍ Brown, J. I.; Nowakowski, R. J. πŸ“‚ Article πŸ“… 2005 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 188 KB
On some subclasses of well-covered graph
On some subclasses of well-covered graphs
✍ Jo Ann W. Staples πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 367 KB πŸ‘ 1 views

A set of points in a graph is independent if no two points in the set are adjacent. A graph is well covered if every maximal independent set is a maximum independent set or, equivalently, if every independent set is contained in a maximum independent set. The well-covered graphs are classified by th

A class of planar well-covered graphs wi
A class of planar well-covered graphs with girth four
✍ Michael R. Pinter πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 616 KB

## Abstract A well‐covered graph is a graph in which every maximal independent set is a maximum independent set; Plummer introduced the concept in a 1970 paper. The notion of a 1‐well‐covered graph was introduced by Staples in her 1975 dissertation: a well‐covered graph __G__ is 1‐well‐covered if a