Graph polynomials derived from Tutte-Martin polynomials
From MaRDI portal
Publication:2575784
DOI10.1016/J.DISC.2004.07.028zbMATH Open1076.05079OpenAlexW2038985924MaRDI QIDQ2575784FDOQ2575784
Publication date: 6 December 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.07.028
Cites Work
- Graphic presentations of isotropic systems
- Greedy algorithm and symmetric matroids
- Isotropic systems
- Tutte-Martin polynomials and orienting vectors of isotropic systems
- Multimatroids. III: Tightness and fundamental graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
