Counting Subgraphs via Homomorphisms (Q5902149)

From MaRDI portal
Revision as of 18:54, 11 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5578333
Language Label Description Also known as
English
Counting Subgraphs via Homomorphisms
scientific article; zbMATH DE number 5578333

    Statements

    Counting Subgraphs via Homomorphisms (English)
    0 references
    0 references
    0 references
    0 references
    14 July 2009
    0 references
    counting graph homomorphisms
    0 references
    exact algorithms
    0 references
    parametrized algorithms
    0 references
    counting subgraphs
    0 references
    computing chromatic polynomial
    0 references
    counting Hamiltonian cycles
    0 references
    counting perfect matchings
    0 references
    color coding based algorithms
    0 references

    Identifiers