A survey on recurrence relations for the independence polynomial of hypergraphs (Q343776): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The vertex-cover polynomial of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4033676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of monomer-dimer systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique polynomials and independent set polynomials of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: From a zoo to a zoology: Towards a general theory of graph polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The covered components polynomial: a new representation of the edge elimination polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Merrifield–Simmons Conjecture Holds for Bipartite Graphs / rank
 
Normal rank

Latest revision as of 23:53, 12 July 2024

scientific article
Language Label Description Also known as
English
A survey on recurrence relations for the independence polynomial of hypergraphs
scientific article

    Statements

    A survey on recurrence relations for the independence polynomial of hypergraphs (English)
    0 references
    0 references
    29 November 2016
    0 references
    independence polynomial
    0 references
    hypergraph
    0 references
    recurrence relation
    0 references
    independent sets
    0 references
    edge operation
    0 references
    vertex operation
    0 references

    Identifiers

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