The following pages link to Dependence polynomials (Q2640617):
Displaying 43 items.
- On the independence polynomial of the corona of graphs (Q260027) (← links)
- Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs (Q412167) (← links)
- A way to construct independence equivalent graphs (Q452914) (← links)
- Shearer's measure and stochastic domination of product measures (Q457089) (← links)
- Graphs with a minimal number of convex sets (Q489304) (← links)
- On the location of roots of independence polynomials (Q596652) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- On a sequence of sparse binomial-type polynomials (Q691817) (← links)
- On the dependence polynomial of a graph (Q854836) (← links)
- The roots of the independence polynomial of a clawfree graph (Q875937) (← links)
- Dependence polynomials of some graph operations (Q895839) (← links)
- Characteristic polynomials of nonnegative real square matrices and generalized clique polynomials (Q972787) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Independence polynomials of circulants with an application to music (Q1025487) (← links)
- Dependence by reverse regular rule (Q1090030) (← links)
- Bounds on the largest root of the matching polynomial (Q1208371) (← links)
- Algorithms for the fixed point property (Q1285782) (← links)
- The maximum number of triangles in a \(K_4\)-free graph (Q1297475) (← links)
- Clique polynomials and independent set polynomials of graphs (Q1322274) (← links)
- Farrell polynomials on graphs of bounded tree width (Q1398293) (← links)
- The independence fractal of a graph. (Q1405113) (← links)
- Roots of independence polynomials of well covered graphs (Q1577528) (← links)
- Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems. (Q1584467) (← links)
- Optimal graphs for independence and \(k\)-independence polynomials (Q1756111) (← links)
- Average independence polynomials (Q1767674) (← links)
- The \(k\)-fractal of a simplicial complex (Q1877647) (← links)
- Number of prefixes in trace monoids: clique polynomials and dependency graphs (Q2106610) (← links)
- Generalizations of the matching polynomial to the multivariate independence polynomial (Q2328133) (← links)
- One more remark on the adjoint polynomial (Q2400981) (← links)
- On the roots of independence polynomials of almost all very well-covered graphs (Q2473044) (← links)
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma (Q2487791) (← links)
- Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture (Q2493111) (← links)
- Reconstructing subgraph-counting graph polynomials of increasing families of graphs (Q2566153) (← links)
- On a poset of trees. II (Q2852613) (← links)
- Dependent pairs (Q3011109) (← links)
- (Q3798911) (← links)
- Note on the Smallest Root of the Independence Polynomial (Q4903259) (← links)
- (Q4963429) (← links)
- Some families of graphs with no nonzero real domination roots (Q5009965) (← links)
- Domain of Dependence (Q5583820) (← links)
- Universal enveloping algebra of a pair of compatible Lie brackets (Q5877771) (← links)
- On the number of edge-disjoint triangles in \(K_4\)-free graphs (Q5970289) (← links)
- A new algorithm for compression of partially commutative alphabets (Q6122306) (← links)
