Approximating the maximum size of a \(k\)-regular induced subgraph by an upper bound on the co-\(k\)-plex number (Q690542)

From MaRDI portal
Revision as of 20:56, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    0 references
    0 references
    0 references
    0 references
    independent sets
    0 references
    induced matchings
    0 references
    0 references
    0 references