✦ LIBER ✦

Well-Covered Vector Spaces of Graphs

✍ Scribed by Brown, J. I.; Nowakowski, R. J.

Book ID: 127123178
Publisher: Society for Industrial and Applied Mathematics
Year: 2005
Tongue: English
Weight: 188 KB
Volume: 19
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480101393039

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Very well covered graphs

✍ O. Favaron 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 481 KB

A gra~h is wen-covered if it has no isolated vertices and all the maximal stable (iadependent) sets have the same cardinality. If fm'thermore this cardinality is equal to ½n, where n is the order of, he graph, the graph is called 'veE¢ well covered'. The class of very well-covered graphs contains in

Well-covered graphs and extendability

✍ Nathaniel Dean; Jennifer Zito 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 928 KB

Well-Covered Claw-Free Graphs

✍ David Tankus; Michael Tarsi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 336 KB

Nonplanar graphs and well-covered cycles

✍ R. Bruce Richter 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 116 KB

In his talk 'Spanning tees of planar maps' at the 19th Southeastern Conference on Combinatorics, Graph Theory and Computing (Baton Rouge, LA, February 1988), Rosenfeld stated the following conjecture. Conjecture. Let G be a 2-connected graph and let % be a collection of cycles in G such that: (i)

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

Subdivisions, parity and well-covered gr

Subdivisions, parity and well-covered graphs

✍ Caro, Yair 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB 👁 2 views

A graph is well-covered if every maximal independent set is maximum. This concept, introduced by Plummer in 1970 (J. Combin. Theory 8 (1970)), is the focal point of much interest and current research. We consider well-covered 2-degenerate graphs and supply a structural (and polynomial time algorithm