The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size (Q2685343)

From MaRDI portal
Revision as of 07:50, 7 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
The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size
scientific article

    Statements

    The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size (English)
    0 references
    0 references
    0 references
    21 February 2023
    0 references
    hypergraph
    0 references
    coloring algorithm
    0 references
    induced subhypergraph
    0 references
    matching number
    0 references
    linear hypergraph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references