Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (Q260061): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2015.09.023 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2015.09.023 / rank | |||
Normal rank | |||
Latest revision as of 12:47, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees |
scientific article |
Statements
Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (English)
0 references
18 March 2016
0 references
independent set
0 references
\(k\)-independent set
0 references
degeneracy
0 references
greedy algorithm
0 references
0 references
