Improving an upper bound on the size of \(k\)-regular induced subgraphs (Q411262)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Improving an upper bound on the size of \(k\)-regular induced subgraphs |
scientific article; zbMATH DE number 6021882
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improving an upper bound on the size of \(k\)-regular induced subgraphs |
scientific article; zbMATH DE number 6021882 |
Statements
Improving an upper bound on the size of \(k\)-regular induced subgraphs (English)
0 references
4 April 2012
0 references
graphs
0 references
independent sets
0 references
induced matchings
0 references
combinatorial optimization
0 references
