On the public citation graph

An Extension of kasteleyn's method of enumerating the 1-factors of planar graphs

https://doi.org/10.1007/bfb0057377
0 signed · 46 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.
Claim with ORCID
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.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jcc.540121014openalex-snapshot
Many‐body conjugated‐circuit computations
inferred← citeshttps://doi.org/10.1006/jagm.1997.0910openalex-snapshot
Even Directed Cycles inH-Free Digraphs
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_27openalex-snapshot
NC algorithms for computing the number of perfect matchings in K 3,3-free graphs and related problems
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_149openalex-snapshot
Pfaffian orientations, 0/1 permanents, and even cycles in directed graphs
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_13openalex-snapshot
A Combinatorial Algorithm for Pfaffians
inferred← citeshttps://doi.org/10.1007/978-3-030-73879-2_16openalex-snapshot
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-74208-1_21openalex-snapshot
Almost Exact Matchings
inferred← citeshttps://doi.org/10.1007/bf01192587openalex-snapshot
Graphical properties of polyhexes: Perfect matching vector and forcing
inferred← citeshttps://doi.org/10.1007/s00224-015-9645-1openalex-snapshot
Counting the Number of Perfect Matchings in K 5-Free Graphs
inferred← citeshttps://doi.org/10.1007/s00453-011-9519-0openalex-snapshot
Almost Exact Matchings
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90640-2openalex-snapshot
Matching theory—a sampler: from Dénes König to the present
inferred← citeshttps://doi.org/10.1016/0024-3795(94)00199-5openalex-snapshot
Sign-nonsingular skew-symmetric matrices
inferred← citeshttps://doi.org/10.1016/0166-218x(89)90053-xopenalex-snapshot
Pfaffian orientations, 0–1 permanents, and even cycles in directed graphs
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90017-5openalex-snapshot
NC algorithms for computing the number of perfect matchings in K3,3-free graphs and related problems
inferred← citeshttps://doi.org/10.1016/1385-7258(80)90037-2openalex-snapshot
Counting complete matchings without using Pfaffians
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50004-xopenalex-snapshot
10.1016/b978-044488002-4/50004-x
inferred← citeshttps://doi.org/10.1016/j.dam.2003.12.001openalex-snapshot
The combinatorial approach yields an NC algorithm for computing Pfaffians
inferred← citeshttps://doi.org/10.1016/j.dam.2026.08.028openalex-snapshot
Excluded conformal minors of Birkhoff–von Neumann graphs with equal global forcing number and maximum anti-forcing number
inferred← citeshttps://doi.org/10.1016/j.indag.2012.12.001openalex-snapshot
The combinatorics of N.G. de Bruijn
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.01.030openalex-snapshot
Pfaffian orientations for a type of bipartite graph
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70395-9openalex-snapshot
Matching and Vertex Packing: How “hard” are They?
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73649-1openalex-snapshot
References
inferred← citeshttps://doi.org/10.1090/s0894-0347-1992-1135027-1openalex-snapshot
The Even Cycle Problem for Directed Graphs
inferred← citeshttps://doi.org/10.1109/ccc.2014.15openalex-snapshot
Counting the Number of Perfect Matchings in K5-Free Graphs
inferred← citeshttps://doi.org/10.1109/focs.2015.65openalex-snapshot
Parameterizing the Permanent: Genus, Apices, Minors, Evaluation Mod 2k
inferred← citeshttps://doi.org/10.1134/s0032946021020046openalex-snapshot
Counting the Number of Perfect Matchings, and Generalized Decision Trees
inferred← citeshttps://doi.org/10.1137/1.9781611977066.23openalex-snapshot
Parameterizing the Permanent: Hardness for fixed excluded minors
inferred← citeshttps://doi.org/10.1137/21m1421751openalex-snapshot
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
inferred← citeshttps://doi.org/10.1137/s0097539793250330openalex-snapshot
Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems
inferred← citeshttps://doi.org/10.1145/3323165.3323206openalex-snapshot
NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs
inferred← citeshttps://doi.org/10.1145/335305.335346openalex-snapshot
A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract)
inferred← citeshttps://doi.org/10.1145/3664648openalex-snapshot
Killing a Vortex
inferred← citeshttps://doi.org/10.12677/aam.2024.139405openalex-snapshot
The Number of Perfect Matching of Tubular Fullerene Graphs
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.25911/5d7a2cd8a6553openalex-snapshot
Ising Graphical Model
inferred← citeshttps://doi.org/10.37236/1384openalex-snapshot
An Exploration of the Permanent-Determinant Method
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/4330openalex-snapshot
The Parity of a Thicket
inferred← citeshttps://doi.org/10.4086/cjtcs.2008.004openalex-snapshot
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2023.120openalex-snapshot
Compositionality of Planar Perfect Matchings: A Universal and Complete Fragment of ZW-Calculus
inferred← citeshttps://doi.org/10.48550/arxiv.1208.1361openalex-snapshot
De combinatoriek van De Bruijn
inferred← citeshttps://doi.org/10.48550/arxiv.1710.01783openalex-snapshot
Some facts on Permanents in Finite Characteristics
inferred← citeshttps://doi.org/10.48550/arxiv.1806.07586openalex-snapshot
Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1912.00620openalex-snapshot
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
inferred← citeshttps://doi.org/10.48550/arxiv.2108.12879openalex-snapshot
Parameterizing the Permanent: Hardness for $K_8$-minor-free graphs
inferred← citeshttps://doi.org/10.5555/1283383.1283396openalex-snapshot
Maximum matching in graphs with an excluded minor
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.