Counting minimal transversals of \(\beta\)-acyclic hypergraphs (Q1713476)

From MaRDI portal
Revision as of 23:25, 17 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
Counting minimal transversals of \(\beta\)-acyclic hypergraphs
scientific article

    Statements

    title
    Counting minimal transversals of \(\beta\)-acyclic hypergraphs (English)
    0 references
    author
    Benjamin Bergougnoux
    0 references
    Florent Capelli
    0 references
    publication date
    25 January 2019
    0 references
    zbMATH Keywords
    counting problem
    0 references
    minimal transversals
    0 references
    dominating sets
    0 references
    \(\beta\)-acyclic hypergraphs
    0 references
    strongly chordal graphs
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05A15
    0 references
    05C65
    0 references
    05D15
    0 references
    05C69
    0 references
    zbMATH DE Number
    7006821
    0 references
    OpenAlex ID
    W2887600670
    0 references
    arXiv ID
    1808.05017
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1713476&oldid=36464633"
    Powered by MediaWiki