Intersection theory for graphs
From MaRDI portal
Publication:1153093
DOI10.1016/0095-8956(81)90068-XzbMath0463.05031OpenAlexW2078293958MaRDI QIDQ1153093
Publication date: 1981
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(81)90068-x
Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)
Related Items (21)
Graphs determined by polynomial invariants ⋮ A bibliography on chromatic polynomials ⋮ On trees with the same restricted \(U\)-polynomial and the Prouhet-Tarry-Escott problem ⋮ A note on Nagami's polynomial invariants for graphs ⋮ A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function ⋮ Chromatic polynomial, \(q\)-binomial counting and colored Jones function ⋮ More connections between the matching polynomial and the chromatic polynomial ⋮ Proper caterpillars are distinguished by their chromatic symmetric function ⋮ Hyperplane reconstruction of the Tutte polynomial of a geometric lattice ⋮ The Potts model and chromatic functions of graphs ⋮ Arrangements, channel assignments, and associated polynomials ⋮ 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 ⋮ Isomorphism of weighted trees and Stanley's isomorphism conjecture for caterpillars ⋮ Resolving Stanley's \(e\)-positivity of claw-contractible-free graphs ⋮ On matroids determined by their Tutte polynomials ⋮ Contraction-deletion invariants for graphs
Cites Work
This page was built for publication: Intersection theory for graphs
