Matroids, delta-matroids and embedded graphs
DOI10.1016/j.jcta.2019.02.023zbMath1417.05103arXiv1403.0920OpenAlexW2963084647WikidataQ128116228 ScholiaQ128116228MaRDI QIDQ2318477
Iain Moffatt, Ralf Rueckriemen, Carolyn Chun, Steven D. Noble
Publication date: 15 August 2019
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.0920
Graph polynomials (05C31) Extremal problems in graph theory (05C35) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (28)
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
- Interlace polynomials for multimatroids and delta-matroids
- Partial duals of plane graphs, separability and the graphs of knots
- Binary matroids and local complementation
- The transition matroid of a 4-regular graph: an introduction
- The group structure of pivot and loop complementation on graphs and set systems
- A quasi-tree expansion of the Krushkal polynomial
- Separability and the genus of a partial dual
- A polynomial of graphs on surfaces
- Graph minors. XX: Wagner's conjecture
- Isotropic matroids. II: Circle graphs
- On the ribbon graphs of links in real projective space
- Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial
- A spanning tree expansion of the Jones polynomial
- Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
- Delta matroids whose fundamental graphs are bipartite
- A note on the production of matroid minors
- Circle graph obstructions
- The delta-sum of matching delta-matroids
- The linear delta-matroid parity problem
- Hopf algebras and Tutte polynomials
- Polynomial invariants of graphs on surfaces
- A recipe theorem for the topological Tutte polynomial of Bollobás and Riordan
- Binary nullity, Euler circuits and interlace polynomials
- Inductive tools for connected delta-matroids and multimatroids
- Non-orientable quasi-trees for the Bollobás-Riordan polynomial
- Knot invariants and the Bollobás-Riordan polynomial of embedded graphs
- Maps and \(\Delta\)-matroids
- A Polynomial Invariant of Graphs On Orientable Surfaces
- Excluded Minors and the Ribbon Graphs of Knots
- Structure in minor-closed classes of matroids
- Twisted duality for embedded graphs
- A characterization of partially dual graphs
- Graph Polynomials and Their Applications I: The Tutte Polynomial
- Graphs, Links, and Duality on Surfaces
- Quasi-tree expansion for the Bollobás-Riordan-Tutte polynomial
- An Upper Bound on the Number of Edges of a 2-Connected Graph
- ALTERNATING SUM FORMULAE FOR THE DETERMINANT AND OTHER LINK INVARIANTS
- THISTLETHWAITE'S THEOREM FOR VIRTUAL LINKS
- Circle graph obstructions under pivoting
- Greedy algorithm and symmetric matroids
- On the Tutte Polynomial of a Morphism of Matroids
- Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
- Graphs on Surfaces
- Coverings and delta-coverings
- Nullity and Loop Complementation for Delta-Matroids
- Evaluations of Topological Tutte Polynomials
- Connectivity in Matroids
- Lectures on matroids
- A Decomposition for Combinatorial Geometries
- On the interplay between embedded graphs and delta-matroids
- Multimatroids. III: Tightness and fundamental graphs
This page was built for publication: Matroids, delta-matroids and embedded graphs