Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree (Q2657095)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7324328
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree |
scientific article; zbMATH DE number 7324328 |
Statements
Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree (English)
0 references
17 March 2021
0 references
\(k\)-independence number
0 references
independence number
0 references
chromatic number
0 references
\(k\)-distance chromatic number
0 references
regular graphs
0 references
0.8638516068458557
0 references
0.844430685043335
0 references
0.8428905606269836
0 references
0.8352405428886414
0 references
0.8264338374137878
0 references
