The clique-transversal set problem in claw-free graphs with degree at most 4 (Q477680)

From MaRDI portal
Revision as of 11:03, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The clique-transversal set problem in claw-free graphs with degree at most 4
scientific article

    Statements

    The clique-transversal set problem in claw-free graphs with degree at most 4 (English)
    0 references
    0 references
    0 references
    9 December 2014
    0 references
    graph algorithms
    0 references
    clique
    0 references
    clique-transversal set problem
    0 references
    polynomial-time algorithm
    0 references
    claw-free graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references