𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some complexity results about threshold graphs

✍ Scribed by F. Margot

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
672 KB
Volume
49
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Some results about f-critical graphs
Some results about f-critical graphs
✍ Guizhen Liu; Jianfeng Hou; Jiansheng Cai πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 171 KB
Complexity results for well-covered grap
Complexity results for well-covered graphs
✍ Ramesh S. Sankaranarayana; Lorna K. Stewart πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 740 KB

## Abstract A graph with __n__ vertices is well covered if every maximal independent set is a maximum independent set and very well covered if every maximal independent set has size __n__/2. In this work, we study these graphs from an algorithmic complexity point of view. We show that well‐covered

Some properties of 2-threshold graphs
Some properties of 2-threshold graphs
✍ P. L. Hammer; N. V. R. Mahadev; U. N. Peled πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 330 KB