On the public citation graph
Pólya's Permanent Problem
0 signed · 156 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jagm.1993.1030openalex-snapshot
The Even Cycle Problem for Planar Digraphs
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_20openalex-snapshot
The Statistics of Dimers on a Lattice
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/bf01297007openalex-snapshot
Extension of partial diagonals of matrices I
inferredcites →https://doi.org/10.1007/bf01298273openalex-snapshot
Extension of partial diagonals of matrices II
inferredcites →https://doi.org/10.1016/0024-3795(84)90164-2openalex-snapshot
Signsolvability revisited
inferredcites →https://doi.org/10.1016/0024-3795(86)90179-5openalex-snapshot
Sign-nonsingular matrices and even cycles in directed graphs
inferredcites →https://doi.org/10.1016/0031-8914(61)90063-5openalex-snapshot
The statistics of dimers on a lattice
inferredcites →https://doi.org/10.1016/0095-8956(75)90048-9openalex-snapshot
A characterization of convertible (0, 1)-matrices
inferredcites →https://doi.org/10.1016/0095-8956(77)90062-4openalex-snapshot
On minimal elementary bipartite graphs
inferredcites →https://doi.org/10.1016/0095-8956(87)90061-xopenalex-snapshot
Characterization of even directed graphs
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/s0167-5060(08)70395-9openalex-snapshot
Matching and Vertex Packing: How “hard” are They?
inferredcites →https://doi.org/10.1017/cbo9780511574733openalex-snapshot
Matrices of Sign-Solvable Linear Systems
inferredcites →https://doi.org/10.1063/1.1703953openalex-snapshot
Dimer Statistics and Phase Transitions
inferredcites →https://doi.org/10.1080/14786436108243366openalex-snapshot
Dimer problem in statistical mechanics-an exact result
inferredcites →https://doi.org/10.1090/dimacs/004/09openalex-snapshot
On sign-nonsingular matrices and the conversion of the permanent into the determinant
inferredcites →https://doi.org/10.1090/s0002-9939-1970-0252415-3openalex-snapshot
A Simplified Form for Nearly Reducible and Nearly Decomposable Matrices
inferredcites →https://doi.org/10.1090/s0002-9939-1971-0279110-xopenalex-snapshot
Conversion of the Permanent into the Determinant
inferredcites →https://doi.org/10.1093/qmath/25.1.303openalex-snapshot
ON THE TWO-COLOURING OF HYPERGRAPHS
inferredcites →https://doi.org/10.1103/physrev.124.1664openalex-snapshot
Statistical Mechanics of Dimers on a Plane Lattice
inferredcites →https://doi.org/10.1145/800133.804350openalex-snapshot
The complexity of satisfiability problems
inferredcites →https://doi.org/10.2140/pjm.1960.10.1067openalex-snapshot
Permanents of cyclic matrices
inferredcites →https://doi.org/10.2140/pjm.1973.44.603openalex-snapshot
Counterexamples to conjectures of Ryser and de Oliveira
inferredcites →https://doi.org/10.2307/121059openalex-snapshot
Permanents, Pfaffian Orientations, and Even Directed Circuits
inferredcites →https://doi.org/10.2307/1909522openalex-snapshot
Qualitative Economics and the Scope of the Correspondence Principle
inferredcites →https://doi.org/10.2307/1909797openalex-snapshot
The Theory of Qualitative Linear Systems
inferredcites →https://doi.org/10.2307/2295937openalex-snapshot
Partitionable Systems and Qualitative Economics
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.23026openalex-snapshot
Minimal bricks with the maximum number of edges
inferred← citeshttps://doi.org/10.1002/jgt.23247openalex-snapshot
A Characterization on Pfaffian Graphs of Cartesian Product G×C2n+1
inferred← citeshttps://doi.org/10.1002/jgt.70032openalex-snapshot
Disjoint Total Dominating Sets in Planar Graphs
inferred← citeshttps://doi.org/10.1002/jgt.70078openalex-snapshot
b‐Invariant Edges in Near‐Bipartite Bricks
inferred← citeshttps://doi.org/10.1002/jgt.70128openalex-snapshot
Characterization of graphs without even F-orientations
inferred← citeshttps://doi.org/10.1002/qua.20670openalex-snapshot
On the matching polynomials of graphs with small number of cycles of even length
inferred← citeshttps://doi.org/10.1007/11496915_18openalex-snapshot
Computing the Inertia from Sign Patterns
inferred← citeshttps://doi.org/10.1007/978-3-030-22996-2_12openalex-snapshot
Complexity of Maximum Fixed Point Problem in Boolean Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-30786-8_5openalex-snapshot
Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_42openalex-snapshot
Strongly Pfaffian Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_67openalex-snapshot
The Flat Wall Theorem for Bipartite Graphs with Perfect Matchings
inferred← citeshttps://doi.org/10.1007/978-3-031-98740-3_14openalex-snapshot
Permanent of Bipartite Graphs in Terms of Determinants
inferred← citeshttps://doi.org/10.1007/978-3-032-28691-8_14openalex-snapshot
Lattice Structure and Efficient Basis Construction for Strongly Connected Orientations
inferred← citeshttps://doi.org/10.1007/978-3-319-24318-4_11openalex-snapshot
Computing Maximal Autarkies with Few and Simple Oracle Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_30openalex-snapshot
Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices
inferred← citeshttps://doi.org/10.1007/978-3-540-72792-7_30openalex-snapshot
Sign-Solvable Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-85221-6_14openalex-snapshot
Recent Progress in Matching Extension
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_65openalex-snapshot
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden
inferred← citeshttps://doi.org/10.1007/978-981-92-3309-0_24openalex-snapshot
Permanental Energy of Graphs
inferred← citeshttps://doi.org/10.1007/s00373-017-1841-0openalex-snapshot
A Sufficient Condition for Pfaffian Graphs on the Torus
inferred← citeshttps://doi.org/10.1007/s00493-011-1687-5openalex-snapshot
Packing directed circuits exactly
inferred← citeshttps://doi.org/10.1007/s00493-026-00211-4openalex-snapshot
Two Disjoint Alternating Paths in Bipartite Graphs: Conformal Crosses
inferred← citeshttps://doi.org/10.1007/s10107-006-0056-6openalex-snapshot
Computing the inertia from sign patterns
inferred← citeshttps://doi.org/10.1007/s10107-007-0107-7openalex-snapshot
Solving linear programs from sign patterns
inferred← citeshttps://doi.org/10.1007/s10587-011-0059-1openalex-snapshot
An identity between the determinant and the permanent of Hessenberg-type matrices
inferred← citeshttps://doi.org/10.1007/s10626-026-00436-xopenalex-snapshot
Bideterminants and balanced interval max-plus matrices
inferred← citeshttps://doi.org/10.1007/s10801-008-0165-9openalex-snapshot
Latin trades in groups defined on planar triangulations
inferred← citeshttps://doi.org/10.1007/s10878-017-0207-0openalex-snapshot
An $$O(|E(G)|^2)$$ O ( | E ( G ) | 2 ) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs
inferred← citeshttps://doi.org/10.1007/s10910-018-0938-xopenalex-snapshot
Pfaffian polyominos on the Klein bottle
inferred← citeshttps://doi.org/10.1007/s10910-019-01019-yopenalex-snapshot
The Pfaffian property of graphs on the Möbius strip based on topological resolution
inferred← citeshttps://doi.org/10.1007/s10958-012-0912-2openalex-snapshot
On the gibson barrier for the pólya problem
inferred← citeshttps://doi.org/10.1007/s10958-014-1762-xopenalex-snapshot
On the Pólya Conversion Problem for Permanents and Determinants
inferred← citeshttps://doi.org/10.1007/s10958-018-3904-zopenalex-snapshot
The Number of Matrices with Nonzero Permanent Over a Finite Field
inferred← citeshttps://doi.org/10.1007/s10958-020-04941-8openalex-snapshot
±1-Matrices with Vanishing Permanent
inferred← citeshttps://doi.org/10.1007/s11425-012-4561-1openalex-snapshot
Pfaffian graphs embedding on the torus
inferred← citeshttps://doi.org/10.1007/s13348-025-00494-8openalex-snapshot
The F-singularities of algebras defined by permanents
inferred← citeshttps://doi.org/10.1007/s40840-014-0093-xopenalex-snapshot
On the Permanental Polynomials of Matrices
inferred← citeshttps://doi.org/10.1016/j.aam.2006.05.004openalex-snapshot
Replacing Pfaffians and applications
inferred← citeshttps://doi.org/10.1016/j.dam.2005.07.001openalex-snapshot
Enumeration of perfect matchings of a type of Cartesian products of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.03.009openalex-snapshot
2-extendability of toroidal polyhexes and Klein-bottle polyhexes
inferred← citeshttps://doi.org/10.1016/j.dam.2009.01.008openalex-snapshot
Recognizing near-bipartite Pfaffian graphs in polynomial time
inferred← citeshttps://doi.org/10.1016/j.dam.2011.07.013openalex-snapshot
On spanning galaxies in digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2014.09.002openalex-snapshot
The Pfaffian property of circulant graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.03.006openalex-snapshot
Color-blind index in graphs of very low degree
inferred← citeshttps://doi.org/10.1016/j.dam.2020.07.006openalex-snapshot
The Pfaffian property of Cayley graphs on dihedral groups
inferred← citeshttps://doi.org/10.1016/j.dam.2024.03.004openalex-snapshot
Removable and forced subgraphs of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.05.044openalex-snapshot
Shortest odd paths in undirected graphs with conservative weight functions
inferred← citeshttps://doi.org/10.1016/j.dam.2025.02.044openalex-snapshot
K 4 -free planar minimal bricks with the maximum number of edges
inferred← citeshttps://doi.org/10.1016/j.dam.2025.06.022openalex-snapshot
Forcing, anti-forcing, global forcing and complete forcing on perfect matchings of graphs — A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2010.10.014openalex-snapshot
Matching signatures and Pfaffian graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113249openalex-snapshot
Matching theory and Barnette's conjecture
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114442openalex-snapshot
A note on the 2-factor Hamiltonicity Conjecture
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114553openalex-snapshot
Nice vertices in cubic graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2008.01.030openalex-snapshot
A Polynomial Time Algorithm for Recognizing Near-Bipartite Pfaffian Graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.023openalex-snapshot
Spanning galaxies in digraphs
inferred← citeshttps://doi.org/10.1016/j.ic.2026.105448openalex-snapshot
Improved algorithms for perfect graphs and odd holes
inferred← citeshttps://doi.org/10.1016/j.jcss.2022.01.004openalex-snapshot
Complexity of fixed point counting problems in Boolean networks
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.04.001openalex-snapshot
Synchronizing Boolean networks asynchronously
inferred← citeshttps://doi.org/10.1016/j.jcta.2018.11.009openalex-snapshot
Kräuter conjecture on permanents is true
inferred← citeshttps://doi.org/10.1016/j.jctb.2004.05.002openalex-snapshot
Regular bipartite graphs with all 2-factors isomorphic
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.12.005openalex-snapshot
Minimally non-Pfaffian graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2010.06.003openalex-snapshot
Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
inferred← citeshttps://doi.org/10.1016/j.jctb.2012.07.004openalex-snapshot
A generalization of Littleʼs Theorem on Pfaffian orientations
inferred← citeshttps://doi.org/10.1016/j.jctb.2016.01.005openalex-snapshot
Odd K3,3 subdivisions in bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.12.001openalex-snapshot
Finding a path with two labels forbidden in group-labeled graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.09.003openalex-snapshot
Excluding a planar matching minor in bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.laa.2004.03.016openalex-snapshot
On the even permutation polytope
inferred← citeshttps://doi.org/10.1016/j.laa.2008.03.022openalex-snapshot
Sign-solvable linear complementarity problems
inferred← citeshttps://doi.org/10.1016/j.laa.2011.12.033openalex-snapshot
The characteristic polynomial and the matchings polynomial of a weighted oriented graph
inferred← citeshttps://doi.org/10.1016/j.physa.2008.06.042openalex-snapshot
Dimer problem on the cylinder and torus
inferred← citeshttps://doi.org/10.1016/j.physa.2008.08.020openalex-snapshot
Dimers and the Ising model
inferred← citeshttps://doi.org/10.1016/j.physa.2016.02.033openalex-snapshot
Dimers on the 33.42 lattice
inferred← citeshttps://doi.org/10.1016/j.procs.2021.11.037openalex-snapshot
The signature matrix for 6-Pfaffian graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.08.032openalex-snapshot
A quadratic identity for the number of perfect matchings of plane graphs
inferred← citeshttps://doi.org/10.1016/s0095-8956(02)00031-xopenalex-snapshot
2-Factor hamiltonian graphs
inferred← citeshttps://doi.org/10.1017/s0004972721000356openalex-snapshot
DETERMINANTS AND PERMANENTS OF POWER MATRICES
inferred← citeshttps://doi.org/10.1080/02331930701421038openalex-snapshot
A note on the parity assignment problem
inferred← citeshttps://doi.org/10.1080/03081087.2016.1201082openalex-snapshot
On the rank of a real skew symmetric matrix described by an oriented graph
inferred← citeshttps://doi.org/10.1090/conm/579/11516openalex-snapshot
Permanent has less zeros than determinant over finite fields
inferred← citeshttps://doi.org/10.1134/s0001434612110053openalex-snapshot
Pólya convertibility problem for symmetric matrices
inferred← citeshttps://doi.org/10.1137/22m1538260openalex-snapshot
The Shortest Even Cycle Problem Is Tractable
inferred← citeshttps://doi.org/10.1137/23m158156xopenalex-snapshot
Odd Paths, Cycles, and \(T\)-Joins: Connections and Algorithms
inferred← citeshttps://doi.org/10.1145/1125994.1125996openalex-snapshot
Finding 3-shredders efficiently
inferred← citeshttps://doi.org/10.1145/3519935.3520030openalex-snapshot
The shortest even cycle problem is tractable
inferred← citeshttps://doi.org/10.1145/3618260.3649682openalex-snapshot
Packing Even Directed Circuits Quarter-Integrally
inferred← citeshttps://doi.org/10.1145/3618260.3649774openalex-snapshot
A Flat Wall Theorem for Matching Minors in Bipartite Graphs
inferred← citeshttps://doi.org/10.1145/3832046.3832058openalex-snapshot
Computing the Permanental Polynomial of Bipartite Graphs
inferred← citeshttps://doi.org/10.1155/2021/6621029openalex-snapshot
Computing the Permanent of the Laplacian Matrices of Nonbipartite Graphs
inferred← citeshttps://doi.org/10.11648/j.ml.20241002.12openalex-snapshot
On the Polya Permanent Problem over Finite Commutative Rings
inferred← citeshttps://doi.org/10.1515/math-2024-0060openalex-snapshot
Further results on enumeration of perfect matchings of Cartesian product graphs
inferred← citeshttps://doi.org/10.2140/agt.2016.16.3167openalex-snapshot
Strong Heegaard diagrams and strong L–spaces
inferred← citeshttps://doi.org/10.23638/dmtcs-22-4-6openalex-snapshot
Even cycles and perfect matchings in claw-free plane graphs
inferred← citeshttps://doi.org/10.37236/141openalex-snapshot
Pfaffian Orientation and Enumeration of Perfect Matchings for some Cartesian Products of Graphs
inferred← citeshttps://doi.org/10.37236/8594openalex-snapshot
On Essentially 4-Edge-Connected Cubic Bricks
inferred← citeshttps://doi.org/10.4007/annals.2006.164.51openalex-snapshot
The strong perfect graph theorem
inferred← citeshttps://doi.org/10.4171/022-3/47openalex-snapshot
A survey of Pfaffian orientations of graphs
inferred← citeshttps://doi.org/10.4213/mzm9071openalex-snapshot
Проблема Полиа о конвертируемости для симметрических матриц
inferred← citeshttps://doi.org/10.48550/arxiv.0709.0125openalex-snapshot
Differential and graphical approaches to multistability theory for chemical reaction networks
inferred← citeshttps://doi.org/10.48550/arxiv.1012.2749openalex-snapshot
Packing directed circuits exactly
inferred← citeshttps://doi.org/10.48550/arxiv.1408.0629openalex-snapshot
Bounds for variables with few occurrences in conjunctive normal forms
inferred← citeshttps://doi.org/10.48550/arxiv.1510.07553openalex-snapshot
Even Orientations and Pfaffian graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1810.04439openalex-snapshot
Kräuter conjecture on permanents is true
inferred← citeshttps://doi.org/10.48550/arxiv.1812.05461openalex-snapshot
The Tight Cut Decomposition of Matching Covered Uniformable Hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.2010.08988openalex-snapshot
Even Circuits in Oriented Matroids
inferred← citeshttps://doi.org/10.48550/arxiv.2012.01278openalex-snapshot
A remark on an equivalence of two versions of Polya's permanent problem
inferred← citeshttps://doi.org/10.48550/arxiv.2110.02013openalex-snapshot
Two Disjoint Alternating Paths in Bipartite Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2110.03483openalex-snapshot
Short proofs on $k$-extendible graphs
inferred← citeshttps://doi.org/10.48550/arxiv.math/0611132openalex-snapshot
Matchings and entropies of cylinders
inferred← citeshttps://doi.org/10.5555/1283383.1283396openalex-snapshot
Maximum matching in graphs with an excluded minor
inferred← citeshttps://doi.org/10.70675/09efd050z2221z47c2z96e9zb50278b8e5acopenalex-snapshot
Simulations intrinsèques et complexités dans les réseaux d'automates
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.