The following pages link to Intersection theory for graphs (Q1153093):
Displaying 21 items.
- A tree distinguishing polynomial (Q106322) (← links)
- Proper caterpillars are distinguished by their chromatic symmetric function (Q393186) (← links)
- Symmetric and quasi-symmetric functions associated to polymatroids (Q735400) (← links)
- Resolving Stanley's \(e\)-positivity of claw-contractible-free graphs (Q783748) (← links)
- Chromatic polynomial, \(q\)-binomial counting and colored Jones function (Q877731) (← links)
- A note on Nagami's polynomial invariants for graphs (Q1121922) (← links)
- Hyperplane reconstruction of the Tutte polynomial of a geometric lattice (Q1163564) (← links)
- A bibliography on chromatic polynomials (Q1366790) (← links)
- On graphs with the same restricted \(U\)-polynomial and the \(U\)-polynomial for rooted graphs (Q1792094) (← links)
- Contraction-deletion invariants for graphs (Q1850504) (← links)
- Graphs determined by polynomial invariants (Q1885023) (← links)
- Arrangements, channel assignments, and associated polynomials (Q1961908) (← links)
- More connections between the matching polynomial and the chromatic polynomial (Q2176164) (← links)
- On the smallest trees with the same restricted \(U\)-polynomial and the rooted \(U\)-polynomial (Q2222953) (← links)
- Isomorphism of weighted trees and Stanley's isomorphism conjecture for caterpillars (Q2327720) (← links)
- On trees with the same restricted \(U\)-polynomial and the Prouhet-Tarry-Escott problem (Q2400582) (← links)
- The Potts model and chromatic functions of graphs (Q2444869) (← links)
- On distinguishing trees by their chromatic symmetric functions (Q2474494) (← links)
- On matroids determined by their Tutte polynomials (Q2575786) (← links)
- A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function (Q2662342) (← links)
- The Equivalence of Two Graph Polynomials and a Symmetric Function (Q3552515) (← links)
