The transition matroid of a 4-regular graph: an introduction
From MaRDI portal
Publication:491757
DOI10.1016/J.EJC.2015.03.016zbMath1319.05034arXiv1307.8097OpenAlexW2165495371MaRDI QIDQ491757
Publication date: 19 August 2015
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.8097
Related Items (13)
A characterization of circle graphs in terms of total unimodularity ⋮ Sorting by reversals and the theory of 4-regular graphs ⋮ From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals ⋮ Binary matroids and local complementation ⋮ Binary functions, degeneracy, and alternating dimaps ⋮ Orienting transversals and transition polynomials of multimatroids ⋮ Transition polynomial as a weight system for binary delta-matroids ⋮ A 2-isomorphism theorem for delta-matroids ⋮ Homotopy type of circle graph complexes motivated by extreme Khovanov homology ⋮ Isotropic matroids. II: Circle graphs ⋮ Matroidal frameworks for topological Tutte polynomials ⋮ A characterization of circle graphs in terms of multimatroid representations ⋮ Matroids, delta-matroids and embedded graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The adjacency matroid of a graph
- Binary matroids and local complementation
- A two-variable interlace polynomial
- On the linear algebra of local complementation
- A polynomial of graphs on surfaces
- The interlace polynomial of a graph
- Graphes de cordes et espaces graphiques
- Chords in a circle and linear algebra over GF(2)
- A combinatorial model for the homfly polynomial
- A multivariate interlace polynomial and its computation for graphs of bounded clique-width
- Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial
- On Tutte polynomials and cycles of plane graphs
- A spanning tree expansion of the Jones polynomial
- State models and the Jones polynomial
- Isotropic systems
- Unimodularity and circle graphs
- Graphic presentations of isotropic systems
- Reducing prime graphs and recognizing circle graphs
- Cycle decomposition by disjoint transpositions
- Cycle decomposition by transpositions
- On a characterization of Gauss codes
- On a formula for the number of Euler trails for a class of digraphs
- Interlace polynomials
- A few weight systems arising from intersection graphs
- Parallel connections and coloured Tutte polynomials
- Virtual knot theory
- On the product of certain permutations
- A matrix for computing the Jones polynomial of a knot
- An alternative formula for the number of Euler trails for a class of digraphs
- On the interlace polynomials
- Binary nullity, Euler circuits and interlace polynomials
- Graphs on surfaces and Khovanov homology
- Mutant knots and intersection graphs
- Maps and \(\Delta\)-matroids
- A Polynomial Invariant of Graphs On Orientable Surfaces
- Twisted duality for embedded graphs
- A Dichromatic Polynomial for Weighted Graphs and Link Polynomials
- Le Polynôme De Martin D'un Graphe Eulerien
- Parametrized Tutte Polynomials of Graphs and Matroids
- A new polynomial invariant of knots and links
- Greedy algorithm and symmetric matroids
- Invariants of links of Conway type
- Strong Tutte Functions of Matroids and Graphs
- A Tutte Polynomial for Coloured Graphs
- Walks through every edge exactly twice
- Multimatroids I. Coverings by Independent Sets
- On the number of Euler trails in directed graphs
- VASSILIEV KNOT INVARIANTS COMING FROM LIE ALGEBRAS AND 4-INVARIANTS
- An Invariant of Regular Isotopy
- Walks through every edge exactly twice II
- Graphs on Surfaces
- On the surface duality of linear graphs
- Evaluations of Topological Tutte Polynomials
- The Homfly and dichromatic polynomials
- Interlacement in 4-regular graphs: a new approach using nonsymmetric matrices
- Theory of Matroids
This page was built for publication: The transition matroid of a 4-regular graph: an introduction
