✦ LIBER ✦

Well-covered graphs and extendability

✍ Scribed by Nathaniel Dean; Jennifer Zito

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 928 KB
Volume: 126
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)90253-4

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

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

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)

Well-Covered Claw-Free Graphs

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

ModelingK-coteries by well-covered graph

ModelingK-coteries by well-covered graphs

✍ Yamashita, Masafumi; Kameda, Tsunehiko (Tiko) 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 3 views

The concept of k-coterie is useful for achieving k-mutual exclusion in distributed systems. A graph is said to be well covered if any of its maximal independent sets is also maximum. We first show that a graph G is well covered with independence number k if and only if G represents the incidence rel

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