✦ LIBER ✦

The structure of well-covered graphs with no cycles of length 4

✍ Scribed by J.I. Brown; R.J. Nowakowski; I.E. Zverovich

Book ID: 108113750
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 187 KB
Volume: 307
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.10.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Recognizing Well Covered Graphs of Famil

Recognizing Well Covered Graphs of Families with SpecialP4-Components

✍ S. Klein, C. P. de Mello, A. Morgana 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 263 KB

Hypergraphs with no cycle of length 4

✍ Ervin Győri; Nathan Lemons 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 183 KB

Covering the vertices of a graph by cycl

Covering the vertices of a graph by cycles of prescribed length

✍ D. Amar; I. Fournier; A. Germa 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB

The main theorem of that paper is the following: let G be a graph of order n, of size at least (nZ -3n + 6 ) / 2 . For any integers k, n,, n2,. . . , nk such that n = n, + n2 + ... + nk and n, 2 3, there exists a covering of the vertices of G by disjoint cycles (C,),=,..,k with ICjl = n,, except whe

()-total choosability of planar graphs w

()-total choosability of planar graphs with no cycles of length from 4 to and without close triangles

✍ Gerard J. Chang; Nicolas Roussel 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 199 KB

The Structure of Well-Covered Graphs and

The Structure of Well-Covered Graphs and the Complexity of Their Recognition Problems

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

A graph is well-covered if all its maximal independent sets are of the same cardinality. Deciding whether a given graph is well-covered is known to be NP-hard in general, and solvable in polynomial time, if the input is restricted to certain families of graphs. We present here a simple structural ch