scientific article; zbMATH DE number 3517179
From MaRDI portal
Publication:4097310
Cited in
(19)- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
- Matching theory -- a sampler: From Dénes König to the present
- Strong orientations without even directed circuits
- The combinatorial approach yields an NC algorithm for computing Pfaffians
- Sign-nonsingular skew-symmetric matrices
- Counting the number of perfect matchings, and generalized decision trees
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
- Almost exact matchings
- Pfaffian orientations for a type of bipartite graph
- The parity of a thicket
- NC algorithms for computing a perfect matching and a maximum flow in one-crossing-minor-free graphs
- Counting problems in parameterized complexity
- Counting the number of perfect matchings in \(K_{5}\)-free graphs
- Counting shortest two disjoint paths in cubic planar graphs with an NC algorithm
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
- Another Hamiltonian cycle in bipartite Pfaffian graphs
- Further results on enumeration of perfect matchings of Cartesian product graphs
- The combinatorics of N. G. de Bruijn
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4097310)
