The following pages link to Pólya's permanent problem (Q1773170):
Displaying 50 items.
- Odd \(K_{3,3}\) subdivisions in bipartite graphs (Q256986) (← links)
- Pfaffian graphs embedding on the torus (Q382787) (← links)
- On spanning galaxies in digraphs (Q415275) (← links)
- The characteristic polynomial and the matchings polynomial of a weighted oriented graph (Q417494) (← links)
- On the Pólya conversion problem for permanents and determinants (Q459468) (← links)
- The Pfaffian property of circulant graphs (Q479041) (← links)
- Face-width of Pfaffian braces and polyhex graphs on surfaces (Q490246) (← links)
- Color-blind index in graphs of very low degree (Q528569) (← links)
- Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem (Q602719) (← links)
- Matching signatures and Pfaffian graphs (Q626770) (← links)
- Packing directed circuits exactly (Q663091) (← links)
- On the permanental polynomials of matrices (Q745925) (← links)
- Computing the inertia from sign patterns (Q877192) (← links)
- Thin edges in braces (Q888627) (← links)
- Solving linear programs from sign patterns (Q927161) (← links)
- Sign-solvable linear complementarity problems (Q929486) (← links)
- Minimally non-Pfaffian graphs (Q947729) (← links)
- Recognizing near-bipartite Pfaffian graphs in polynomial time (Q987672) (← links)
- 2-extendability of toroidal polyhexes and Klein-bottle polyhexes (Q1003671) (← links)
- Latin trades in groups defined on planar triangulations (Q1043843) (← links)
- Dimers on the \(3^3 . 4^2\) lattice (Q1619468) (← links)
- Kräuter conjecture on permanents is true (Q1633378) (← links)
- The number of matrices with nonzero permanent over a finite field (Q1662013) (← links)
- A sufficient condition for Pfaffian graphs on the torus (Q1684942) (← links)
- Pfaffian polyominos on the Klein bottle (Q1713983) (← links)
- An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs (Q1743482) (← links)
- Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians (Q1883410) (← links)
- On the even permutation polytope (Q1887623) (← links)
- On the Gibson barrier for the Pólya problem (Q1930200) (← links)
- A generalization of Little's theorem on Pfaffian orientations (Q1931399) (← links)
- Pólya convertibility problem for symmetric matrices (Q1946423) (← links)
- Colouring non-even digraphs (Q2094875) (← links)
- Matching theory and Barnette's conjecture (Q2099486) (← links)
- Complexity of fixed point counting problems in Boolean networks (Q2119407) (← links)
- Finding a path with two labels forbidden in group-labeled graphs (Q2173429) (← links)
- The Pfaffian property of Cayley graphs on dihedral groups (Q2197482) (← links)
- \( \pm 1\)-matrices with vanishing permanent (Q2202846) (← links)
- Computing the permanent of the Laplacian matrices of nonbipartite graphs (Q2230052) (← links)
- On essentially 4-edge-connected cubic bricks (Q2290348) (← links)
- \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks (Q2309225) (← links)
- A quadratic identity for the number of perfect matchings of plane graphs (Q2378519) (← links)
- Replacing Pfaffians and applications (Q2383534) (← links)
- A conjecture of Norine and Thomas for abelian Cayley graphs (Q2409829) (← links)
- The Pfaffian property of graphs on the Möbius strip based on topological resolution (Q2419230) (← links)
- Enumeration of perfect matchings of a type of Cartesian products of graphs (Q2581564) (← links)
- Generating bricks (Q2642014) (← links)
- Enumeration of perfect matchings of the Cartesian products of graphs (Q2699650) (← links)
- Lower bounds for Pólya’s problem on permanent (Q2828348) (← links)
- Spanning galaxies in digraphs (Q2851453) (← links)
- An identity between the determinant and the permanent of Hessenberg-type matrices (Q2881222) (← links)
