Algorithms for clique-independent sets on subclasses of circular-arc graphs (Q2500526)

From MaRDI portal
Revision as of 09:19, 5 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Algorithms for clique-independent sets on subclasses of circular-arc graphs
scientific article

    Statements

    Algorithms for clique-independent sets on subclasses of circular-arc graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 August 2006
    0 references
    Helly circular-arc graphs
    0 references

    Identifiers