Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (Q260061)
From MaRDI portal
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
