From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals
From MaRDI portal
Publication:6064591
DOI10.4171/8ecm/10zbMath1526.05038MaRDI QIDQ6064591
Publication date: 10 November 2023
Published in: European Congress of Mathematics (Search for Journal in Brave)
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of matroids and geometric lattices (05B35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
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
- Practical and efficient circle graph recognition
- The transition matroid of a 4-regular graph: an introduction
- A polynomial of graphs on surfaces
- The interlace polynomial of a graph
- Graph minors. XX: Wagner's conjecture
- Circle graphs and monadic second-order logic
- Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial
- On theories of Whitney and Tutte
- Some combinatorial properties of discriminants in metric vector spaces
- A spanning tree expansion of the Jones polynomial
- Isotropic systems
- Unimodularity and circle graphs
- Pseudomatroids
- Graphic presentations of isotropic systems
- Directed submodularity, ditroids and directed submodular flows
- Reducing prime graphs and recognizing circle graphs
- Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
- Bimatroids and invariants
- A generalization of Tutte's characterization of totally unimodular matrices
- On the Melvin-Morton-Rozansky conjecture
- A 2-isomorphism theorem for delta-matroids
- Matroids, delta-matroids and embedded graphs
- Partial duality and closed 2-cell embeddings
- Mutant knots and intersection graphs
- The Jones polynomial and graphs on surfaces
- Maps and \(\Delta\)-matroids
- A Polynomial Invariant of Graphs On Orientable Surfaces
- An Algorithm for Determining Whether a Given Binary Matroid is Graphic
- THISTLETHWAITE'S THEOREM FOR VIRTUAL LINKS
- Circle graph obstructions under pivoting
- Greedy algorithm and symmetric matroids
- Decomposition of Directed Graphs
- On Whitney's 2‐isomorphism theorem for graphs
- Recognition of Circle Graphs
- Multimatroids I. Coverings by Independent Sets
- Almost all matroids are nonrepresentable
- Recognizing circle graphs in polynomial time
- Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
- Delta-matroids for graph theorists
- On the interplay between embedded graphs and delta-matroids
- Multimatroids. III: Tightness and fundamental graphs
This page was built for publication: From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals
