From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals

DOI10.4171/8ECM/10zbMATH Open1526.05038MaRDI QIDQ6064591FDOQ6064591

Iain Moffatt

Publication date: 10 November 2023

Published in: European Congress of Mathematics (Search for Journal in Brave)

zbMATH Keywords

treedualmatroidquasi-treeembedded graphribbon graphpivotdelta-matroidpartial dual

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
• Graph minors. XX: Wagner's conjecture
• Graphs on surfaces
• A polynomial invariant of graphs on orientable surfaces
• A polynomial of graphs on surfaces
• A spanning tree expansion of the Jones polynomial
• Topological graph theory.
• On the Melvin-Morton-Rozansky conjecture
• Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial
• The Jones polynomial and graphs on surfaces
• Decomposition of Directed Graphs
• Recognition of Circle Graphs
• Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
• Graphic presentations of isotropic systems
• Reducing prime graphs and recognizing circle graphs
• Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
• Matroids, delta-matroids and embedded graphs
• Maps and \(\Delta\)-matroids
• On the interplay between graphs and matroids
• Greedy algorithm and symmetric matroids
• Recognizing circle graphs in polynomial time
• Practical and efficient circle graph recognition
• On the interplay between embedded graphs and delta-matroids
• Circle graphs and monadic second-order logic
• Isotropic systems
• A generalization of Tutte's characterization of totally unimodular matrices
• Multimatroids I. Coverings by Independent Sets
• Multimatroids. III: Tightness and fundamental graphs
• The interlace polynomial of a graph
• Pseudomatroids
• Directed submodularity, ditroids and directed submodular flows
• Some combinatorial properties of discriminants in metric vector spaces
• THISTLETHWAITE'S THEOREM FOR VIRTUAL LINKS
• Unimodularity and circle graphs
• Mutant knots and intersection graphs
• Circle graph obstructions under pivoting
• The transition matroid of a 4-regular graph: an introduction
• On Whitney's 2‐isomorphism theorem for graphs
• A 2-isomorphism theorem for delta-matroids
• Bimatroids and invariants
• Delta-matroids for graph theorists
• On theories of Whitney and Tutte
• Partial duality and closed 2-cell embeddings
• Almost all matroids are nonrepresentable

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)