The following pages link to Pólya's permanent problem (Q1773170):
Displayed 25 items.
- 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)
- 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)
- Computing the inertia from sign patterns (Q877192) (← 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)
- 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)
- A quadratic identity for the number of perfect matchings of plane graphs (Q2378519) (← links)
- Replacing Pfaffians and applications (Q2383534) (← links)
- Enumeration of perfect matchings of a type of Cartesian products of graphs (Q2581564) (← links)
- Generating bricks (Q2642014) (← links)
- Spanning galaxies in digraphs (Q2851453) (← links)
- An identity between the determinant and the permanent of Hessenberg-type matrices (Q2881222) (← links)
- A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs (Q3503547) (← links)