Recommendations
Cited in
(67)- Odd \(K_{3,3}\) subdivisions in bipartite graphs
- Synchronizing Boolean networks asynchronously
- Excluding a planar matching minor in bipartite graphs
- scientific article; zbMATH DE number 1559555 (Why is no real title available?)
- On essentially 4-edge-connected cubic bricks
- On spanning galaxies in digraphs
- Computing the permanent of the Laplacian matrices of nonbipartite graphs
- The carbuncle phenomenon is incurable
- Kräuter conjecture on permanents is true
- On the even permutation polytope
- Computing maximal autarkies with few and simple oracle queries
- The characteristic polynomial and the matchings polynomial of a weighted oriented graph
- Minimally non-Pfaffian graphs
- Lower bounds for Pólya's problem on permanent
- 2-extendability of toroidal polyhexes and Klein-bottle polyhexes
- Complexity of fixed point counting problems in Boolean networks
- Generating bricks
- Dimers on the 3³ . 4² lattice
- Latin trades in groups defined on planar triangulations
- Permanents, Pfaffian orientations, and even directed circuits
- The Pfaffian property of Cayley graphs on dihedral groups
- Minimal braces
- A generalization of Little's theorem on Pfaffian orientations
- A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs
- Shortest odd paths in undirected graphs with conservative weight functions
- scientific article; zbMATH DE number 7569244 (Why is no real title available?)
- Thin edges in braces
- The Pfaffian property of graphs on the Möbius strip based on topological resolution
- Matching signatures and Pfaffian graphs
- Computing the inertia from sign patterns
- Solving linear programs from sign patterns
- Sign-solvable linear complementarity problems
- The number of matrices with nonzero permanent over a finite field
- On the permanental polynomials of matrices
- Replacing Pfaffians and applications
- The Pfaffian property of circulant graphs
- Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
- On the rank of a real skew symmetric matrix described by an oriented graph
- Graph characterization of fully indecomposable nonconvertible \((0, 1)\)-matrices with minimal number of ones
- Enumeration of perfect matchings of a type of Cartesian products of graphs
- Even circuits in oriented matroids
- On the Pólya conversion problem for permanents and determinants
- A quadratic identity for the number of perfect matchings of plane graphs
- On the Gibson barrier for the Pólya problem
- Pólya convertibility problem for symmetric matrices
- A sufficient condition for Pfaffian graphs on the torus
- Colouring non-even digraphs
- Face-width of Pfaffian braces and polyhex graphs on surfaces
- \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks
- An identity between the determinant and the permanent of Hessenberg-type matrices
- Removable and forced subgraphs of graphs
- Spanning galaxies in digraphs
- Determinants and permanents of power matrices
- A conjecture of Norine and Thomas for abelian Cayley graphs
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
- Even cycles and perfect matchings in claw-free plane graphs
- An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs
- Packing directed circuits exactly
- Pfaffian graphs embedding on the torus
- Enumeration of perfect matchings of the Cartesian products of graphs
- Recognizing near-bipartite Pfaffian graphs in polynomial time
- Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians
- Matching theory and Barnette's conjecture
- \( \pm 1\)-matrices with vanishing permanent
- Colouring non-even digraphs
- Pfaffian polyominos on the Klein bottle
- Color-blind index in graphs of very low degree
This page was built for publication: Pólya's permanent problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1773170)
