Counting independent sets in graphs with bounded bipartite pathwidth (Q6310891)

From MaRDI portal
Revision as of 09:33, 10 July 2024 by Import240710060729 (talk | contribs) (Added link to MaRDI item.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7173308
Language Label Description Also known as
English
Counting independent sets in graphs with bounded bipartite pathwidth
scientific article; zbMATH DE number 7173308

    Statements

    publication date
    7 December 2018
    0 references
    arXiv ID
    1812.03195
    0 references
    arXiv classification
    cs.DM
    0 references
    math.CO
    0 references
    author
    Martin Dyer
    0 references
    Catherine Greenhill
    0 references
    Haiko Müller
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C30
    0 references
    05C69
    0 references
    05C85
    0 references
    68W20
    0 references
    68W25
    0 references
    zbMATH DE Number
    7173308
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6310891&oldid=35896751"
    Powered by MediaWiki