Pfaffian graphs, T-joins and crossing numbers
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3544865 (Why is no real title available?)
- 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)- On the theory of Pfaffian orientations. II: \(T\)-joins, \(k\)-cuts, and duality of enumeration
- Variations on a theme of Kasteleyn, with application to the totally nonnegative Grassmannian
- Drawing 4-Pfaffian graphs on the torus
- Removing even crossings on surfaces
- On the Pfaffian number of graphs
- Removing even crossings
- Holographic algorithms without matchgates
- Graph Drawing
- Removing Even Crossings on Surfaces
- Pfaffian labelings and signs of edge colorings
- T-joins in strongly connected hypergraphs
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)