Pfaffian graphs, T-joins and crossing numbers
DOI10.1007/S00493-008-2150-2zbMATH Open1199.05075OpenAlexW2028433962MaRDI QIDQ949784FDOQ949784
Authors: Serguei Norine 
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
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- A note on the parity of the number of crossings of a graph
- A survey of Pfaffian orientations of graphs
- Bounds for generalized thrackles
- Combinatorial optimization. Packing and covering
- Graph Drawing
- Matching theory
- Matchings in graphs on non-orientable surfaces
- Matroids and multicommodity flows
- On Conway's thrackle conjecture
- On the theory of Pfaffian orientations. II: \(T\)-joins, \(k\)-cuts, and duality of enumeration
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- Toward a theory of crossing numbers
Cited In (11)
- Variations on a theme of Kasteleyn, with application to the totally nonnegative Grassmannian
- Removing even crossings
- Removing even crossings on surfaces
- Graph Drawing
- Removing Even Crossings on Surfaces
- Pfaffian labelings and signs of edge colorings
- Holographic algorithms without matchgates
- On the theory of Pfaffian orientations. II: \(T\)-joins, \(k\)-cuts, and duality of enumeration
- T-joins in strongly connected hypergraphs
- Drawing 4-Pfaffian graphs on the torus
- On the Pfaffian number of graphs
This page was built for publication: Pfaffian graphs, \(T\)-joins and crossing numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q949784)
