Approximating the maximum size of a \(k\)-regular induced subgraph by an upper bound on the co-\(k\)-plex number (Q690542): Difference between revisions
From MaRDI portal
Latest revision as of 22:55, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximating the maximum size of a \(k\)-regular induced subgraph by an upper bound on the co-\(k\)-plex number |
scientific article |
Statements
Approximating the maximum size of a \(k\)-regular induced subgraph by an upper bound on the co-\(k\)-plex number (English)
0 references
28 November 2012
0 references
independent sets
0 references
induced matchings
0 references
0 references