A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets (Q1322267): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3919752 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4711490 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Very well covered graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3211344 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5184700 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A characterization of well covered graphs of girth 5 or greater / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some covering concepts in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4179024 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On some subclasses of well-covered graphs / rank | |||
Normal rank | |||
Latest revision as of 15:33, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets |
scientific article |
Statements
A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets (English)
0 references
9 June 1994
0 references
A graph \(G\) is called a well-covered graph if every maximal independent set of \(G\) is a maximum. This article considers graphs in which there are exactly two sizes of maximal independent sets. A characterization of such graphs is obtained for graphs of girth eight or more.
0 references
well-covered graph
0 references
maximal independent set
0 references
girth
0 references
