The following pages link to Pólya's permanent problem (Q1773170):
Displaying 16 items.
- Spanning galaxies in digraphs (Q2851453) (← links)
- An identity between the determinant and the permanent of Hessenberg-type matrices (Q2881222) (← links)
- Even cycles and perfect matchings in claw-free plane graphs (Q3386627) (← links)
- Computing Maximal Autarkies with Few and Simple Oracle Queries (Q3453219) (← links)
- A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs (Q3503547) (← links)
- On the rank of a real skew symmetric matrix described by an oriented graph (Q4603668) (← links)
- DETERMINANTS AND PERMANENTS OF POWER MATRICES (Q5023504) (← links)
- Even circuits in oriented matroids (Q5052170) (← links)
- (Q5095316) (← links)
- Graph characterization of fully indecomposable nonconvertible (0, 1)-matrices with minimal number of ones (Q5217066) (← links)
- Minimal braces (Q6055406) (← links)
- Synchronizing Boolean networks asynchronously (Q6098155) (← links)
- Excluding a planar matching minor in bipartite graphs (Q6144397) (← links)
- Removable and forced subgraphs of graphs (Q6495257) (← links)
- Shortest odd paths in undirected graphs with conservative weight functions (Q6611004) (← links)
- Colouring non-even digraphs (Q6621244) (← links)