Pages that link to "Item:Q1296158"

The following pages link to A weighted graph polynomial from chromatic invariants of knots (Q1296158):

Displaying 50 items.

• A tree distinguishing polynomial (Q106322) (← links)
• Lattice points in orthotopes and a huge polynomial Tutte invariant of weighted gain graphs (Q256998) (← links)
• Chromatic quasisymmetric functions (Q271744) (← links)
• Proper caterpillars are distinguished by their chromatic symmetric function (Q393186) (← links)
• Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width (Q463068) (← links)
• Potts models with magnetic field: arithmetic, geometry, and computation (Q490953) (← links)
• The Tutte-Potts connection in the presence of an external magnetic field (Q719787) (← links)
• Symmetric and quasi-symmetric functions associated to polymatroids (Q735400) (← links)
• Resolving Stanley's \(e\)-positivity of claw-contractible-free graphs (Q783748) (← links)
• Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements (Q857417) (← links)
• Chromatic polynomial, \(q\)-binomial counting and colored Jones function (Q877731) (← links)
• Weighted graph colorings (Q963274) (← links)
• An extension of the bivariate chromatic polynomial (Q1041177) (← links)
• The Go polynomials of a graph. (Q1426435) (← links)
• On the algebraic complexity of some families of coloured Tutte polynomials (Q1433009) (← links)
• The polychromate and a chord diagram polynomial (Q1575089) (← links)
• Order quasisymmetric functions distinguish rooted trees (Q1686218) (← 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)
• Chromatic invariants for finite graphs: Theme and polynomial variations (Q1899442) (← links)
• An extension of Stanley's chromatic symmetric function to binary delta-matroids (Q1981669) (← links)
• A Tutte polynomial for maps. II: The non-orientable case (Q1987091) (← links)
• A note on recognizing an old friend in a new place: list coloring and the zero-temperature Potts model (Q2019203) (← links)
• Tutte polynomials of vertex-weighted graphs and group cohomology (Q2036374) (← links)
• Modular relations of the Tutte symmetric function (Q2068611) (← links)
• Plethysms of chromatic and Tutte symmetric functions (Q2161218) (← links)
• More connections between the matching polynomial and the chromatic polynomial (Q2176164) (← links)
• Polynomial graph invariants and the KP hierarchy (Q2190734) (← links)
• A deletion-contraction relation for the chromatic symmetric function (Q2198977) (← links)
• On the smallest trees with the same restricted \(U\)-polynomial and the rooted \(U\)-polynomial (Q2222953) (← links)
• Some applications of Wagner's weighted subgraph counting polynomial (Q2236817) (← links)
• A logician's view of graph polynomials (Q2273013) (← links)
• Tutte polynomials for directed graphs (Q2284730) (← links)
• A few more trees the chromatic symmetric function can distinguish (Q2299412) (← 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)
• On the Potts model partition function in an external field (Q2428520) (← links)
• Orbit-counting polynomials for graphs and codes (Q2470463) (← links)
• On distinguishing trees by their chromatic symmetric functions (Q2474494) (← links)
• A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function (Q2662342) (← links)
• A note on distinguishing trees with the chromatic symmetric function (Q2666579) (← links)
• Measures of spin ordering in the Potts model with a generalized external magnetic field (Q2686941) (← links)
• Semantic Equivalence of Graph Polynomials Definable in Second Order Logic (Q2820700) (← links)
• The signed weighted resolution set is not a complete pseudoknot invariant (Q2827428) (← links)
• On the reconstruction of graph invariants (Q2851492) (← links)
• Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width (Q3012830) (← links)
• A Dichromatic Polynomial for Weighted Graphs and Link Polynomials (Q3198546) (← links)
• Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants (Q3507454) (← links)
• The Equivalence of Two Graph Polynomials and a Symmetric Function (Q3552515) (← links)