Pfaffian graphs, \(T\)-joins and crossing numbers
From MaRDI portal
Publication:949784
DOI10.1007/s00493-008-2150-2zbMath1199.05075OpenAlexW2028433962MaRDI QIDQ949784
Publication date: 21 October 2008
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-008-2150-2
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Variations on a theme of Kasteleyn, with application to the totally nonnegative Grassmannian, Drawing 4-Pfaffian graphs on the torus, Removing even crossings, Holographic algorithms without matchgates, Removing Even Crossings on Surfaces, Pfaffian labelings and signs of edge colorings, Removing even crossings on surfaces
Cites Work
- Unnamed Item
- Unnamed Item
- Matching theory
- Matroids and multicommodity flows
- A note on the parity of the number of crossings of a graph
- On the theory of Pfaffian orientations. II: \(T\)-joins, \(k\)-cuts, and duality of enumeration
- On Conway's thrackle conjecture
- Matchings in graphs on non-orientable surfaces
- Bounds for generalized thrackles
- Combinatorial Optimization
- The statistics of dimers on a lattice
- Toward a theory of crossing numbers
- Graph Drawing