Algorithms for finding clique-transversals of graphs (Q940841)

From MaRDI portal
Revision as of 15:03, 28 June 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
Algorithms for finding clique-transversals of graphs
scientific article

    Statements

    Algorithms for finding clique-transversals of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 September 2008
    0 references
    algorithms
    0 references
    circular-arc graphs
    0 references
    clique-transversals
    0 references
    Helly circular-arc graphs
    0 references
    \(\overline{3K_{2}}\)-free circular-arc graphs
    0 references

    Identifiers