Intersection theory for graphs
From MaRDI portal
Cites work
- A note on the line reconstruction problem
- Codichromatic graphs
- Graph reconstruction—a survey
- scientific article; zbMATH DE number 3666823 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- Hyperplane reconstruction of the Tutte polynomial of a geometric lattice
- Intersection Theory for Embeddings of Matroids into Uniform Geometries
- On dichromatic polynomials
Cited in
(24)- A tree distinguishing polynomial
- A note on Nagami's polynomial invariants for graphs
- Hyperplane reconstruction of the Tutte polynomial of a geometric lattice
- A bibliography on chromatic polynomials
- On graphs with the same restricted \(U\)-polynomial and the \(U\)-polynomial for rooted graphs
- Contraction-deletion invariants for graphs
- Graphs determined by polynomial invariants
- Arrangements, channel assignments, and associated polynomials
- More connections between the matching polynomial and the chromatic polynomial
- On the smallest trees with the same restricted U-polynomial and the rooted U-polynomial
- Isomorphism of weighted trees and Stanley's isomorphism conjecture for caterpillars
- On trees with the same restricted \(U\)-polynomial and the Prouhet-Tarry-Escott problem
- The Potts model and chromatic functions of graphs
- On distinguishing trees by their chromatic symmetric functions
- On matroids determined by their Tutte polynomials
- A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function
- The equivalence of two graph polynomials and a symmetric function
- Proper caterpillars are distinguished by their chromatic symmetric function
- Chromatically equivalent chordal graphs
- A study on T-equivalent graphs
- Chain Tutte polynomials
- Symmetric and quasi-symmetric functions associated to polymatroids
- Resolving Stanley's \(e\)-positivity of claw-contractible-free graphs
- Chromatic polynomial, \(q\)-binomial counting and colored Jones function
This page was built for publication: Intersection theory for graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1153093)