On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7 (Q389981): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C69 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6248994 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
well-covered graph | |||
| Property / zbMATH Keywords: well-covered graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
maximal independent set | |||
| Property / zbMATH Keywords: maximal independent set / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
girth | |||
| Property / zbMATH Keywords: girth / rank | |||
Normal rank | |||
Revision as of 14:50, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7 |
scientific article |
Statements
On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7 (English)
0 references
22 January 2014
0 references
well-covered graph
0 references
maximal independent set
0 references
girth
0 references
