A linking polynomial of two matroids
From MaRDI portal
Recommendations
Cites work
- A characterization of Tutte invariants of 2-polymatroids
- Decomposition of Finite Graphs Into Forests
- Edge-Disjoint Spanning Trees of Finite Graphs
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3739583 (Why is no real title available?)
- scientific article; zbMATH DE number 3784908 (Why is no real title available?)
- scientific article; zbMATH DE number 475578 (Why is no real title available?)
- On the Problem of Decomposing a Graph into n Connected Factors
- On the Tutte Polynomial of a Morphism of Matroids
- The Tutte polynomial of a morphism of matroids. I: Set-pointed matroids and matroid perspectives
Cited in
(11)- Cyclic flats and corners of the linking polynomial
- Tutte's dichromate for signed graphs
- A decomposition theorem for the linking polynomial of two matroids
- The Tutte polynomial of a morphism of matroids. IV: Computational complexity
- The Tutte polynomial of a morphism of matroids. V: Derivatives as generating functions of Tutte activities
- A Tutte decomposition for matrices and bimatroids
- On the activities of p-basis of matroid perspectives
- Linear relations on the coefficients of the linking polynomial
- scientific article; zbMATH DE number 125462 (Why is no real title available?)
- Corrigendum to ``A linking polynomial of two matroids
- LINKING SYSTEMS AND MATROID PENCILS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
This page was built for publication: A linking polynomial of two matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1433013)