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

From MaRDI portal
Revision as of 23:20, 12 June 2024 by ArxivImporter (talk | contribs) (‎Created a new 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

    7 December 2018
    0 references
    cs.DM
    0 references
    math.CO
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references