From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals
From MaRDI portal
Publication:6064591
Summary: To what extent is a graph determined by the trees in it? What changes if we ask this question not for graphs in the abstract, but graphs that are embedded on surfaces? By considering these questions we will see how a collection of seemingly disjoint topics in mathematics are brought together through the idea of a partial dual. For the entire collection see [Zbl 1519.00033].
Recommendations
Cites work
- A 2-isomorphism theorem for delta-matroids
- A generalization of Tutte's characterization of totally unimodular matrices
- A polynomial invariant of graphs on orientable surfaces
- A polynomial of graphs on surfaces
- A spanning tree expansion of the Jones polynomial
- Almost all matroids are nonrepresentable
- An Algorithm for Determining Whether a Given Binary Matroid is Graphic
- Bimatroids and invariants
- Circle graph obstructions under pivoting
- Circle graphs and monadic second-order logic
- Decomposition of Directed Graphs
- Delta-matroids for graph theorists
- Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
- Directed submodularity, ditroids and directed submodular flows
- Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial
- Graph minors. XX: Wagner's conjecture
- Graphic presentations of isotropic systems
- Graphs on surfaces
- Greedy algorithm and symmetric matroids
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3156382 (Why is no real title available?)
- scientific article; zbMATH DE number 4162893 (Why is no real title available?)
- scientific article; zbMATH DE number 3970769 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 1445310 (Why is no real title available?)
- scientific article; zbMATH DE number 5251649 (Why is no real title available?)
- scientific article; zbMATH DE number 3257167 (Why is no real title available?)
- scientific article; zbMATH DE number 3049182 (Why is no real title available?)
- Isotropic systems
- Maps and -matroids
- Matroids, delta-matroids and embedded graphs
- Multimatroids I. Coverings by Independent Sets
- Multimatroids. III: Tightness and fundamental graphs
- Mutant knots and intersection graphs
- On the interplay between embedded graphs and delta-matroids
- On the interplay between graphs and matroids
- On the Melvin-Morton-Rozansky conjecture
- On theories of Whitney and Tutte
- On Whitney's 2‐isomorphism theorem for graphs
- Partial duality and closed 2-cell embeddings
- Practical and efficient circle graph recognition
- Pseudomatroids
- Recognition of Circle Graphs
- Recognizing circle graphs in polynomial time
- Reducing prime graphs and recognizing circle graphs
- Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
- Some combinatorial properties of discriminants in metric vector spaces
- The interlace polynomial of a graph
- The Jones polynomial and graphs on surfaces
- The transition matroid of a 4-regular graph: an introduction
- THISTLETHWAITE'S THEOREM FOR VIRTUAL LINKS
- Topological graph theory.
- Unimodularity and circle graphs
This page was built for publication: From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6064591)
