The polychromate and a chord diagram polynomial

DOI10.1007/s000260050008zbMath0993.05077OpenAlexW2083605028MaRDI QIDQ1575089

Irasema Sarmiento

Publication date: 25 September 2002

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s000260050008

zbMATH Keywords

intersection graphsVassiliev invariantspolychromatechord diagrams of knots

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)

Related Items

Graphs determined by polynomial invariants ⋮ On trees with the same restricted \(U\)-polynomial and the Prouhet-Tarry-Escott problem ⋮ A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function ⋮ Chromatic polynomial, \(q\)-binomial counting and colored Jones function ⋮ Proper caterpillars are distinguished by their chromatic symmetric function ⋮ The Potts model and chromatic functions of graphs ⋮ On the smallest trees with the same restricted \(U\)-polynomial and the rooted \(U\)-polynomial ⋮ The Equivalence of Two Graph Polynomials and a Symmetric Function ⋮ On distinguishing trees by their chromatic symmetric functions ⋮ A tree distinguishing polynomial ⋮ On graphs with the same restricted \(U\)-polynomial and the \(U\)-polynomial for rooted graphs ⋮ Symmetric and quasi-symmetric functions associated to polymatroids ⋮ Modular relations of the Tutte symmetric function ⋮ Resolving Stanley's \(e\)-positivity of claw-contractible-free graphs