Graph polynomials derived from Tutte-Martin polynomials
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4162893 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 1445310 (Why is no real title available?)
- scientific article; zbMATH DE number 3257167 (Why is no real title available?)
- Graphic presentations of isotropic systems
- Greedy algorithm and symmetric matroids
- Isotropic systems
- Multimatroids. III: Tightness and fundamental graphs
- Tutte-Martin polynomials and orienting vectors of isotropic systems
Cited in
(13)- Interlace polynomials for multimatroids and delta-matroids
- Interlace polynomials of lollipop and tadpole graphs
- Distance Hereditary Graphs and the Interlace Polynomial
- Le Polynôme De Martin D'un Graphe Eulerien
- The interlace polynomial and the Tutte–Martin polynomial
- Interlace polynomials of 4n-snowflake graphs
- Interlace polynomials of friendship graphs
- Circle graphs and the cycle double cover conjecture
- Fast evaluation of interlace polynomials on graphs of bounded treewidth
- Differentiating the Martin polynomial
- Binary matroids and local complementation
- Vertex-minors of graphs: a survey
- Orienting transversals and transition polynomials of multimatroids
This page was built for publication: Graph polynomials derived from Tutte-Martin polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2575784)