On Almost Well-Covered Graphs of Girth at Least 6
We consider a relaxation of the concept of well-covered graphs, which are graphs with all maximal independent sets of the same size. The extent to which a graph fails to be well-covered can be measured by its independence gap, defined as the difference between the maximum and minimum sizes of a maxi...
| Published in: | Discrete Mathematics & Theoretical Computer Science |
|---|---|
| Main Authors: | , , , |
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2018-11-01
|
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/4514/pdf |