On the public citation graph

Even Circuits of Prescribed Clockwise Parity

https://doi.org/10.37236/1738
0 signed · 28 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jctb.2000.2025openalex-snapshot
A Characterisation of Pfaffian Near Bipartite Graphs
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/s0012-365x(01)00060-7openalex-snapshot
Towards a characterisation of Pfaffian near bipartite graphs
inferredcites →https://doi.org/10.2307/121059openalex-snapshot
Permanents, Pfaffian Orientations, and Even Directed Circuits
inferredcites →https://doi.org/10.4153/cjm-1973-077-1openalex-snapshot
Kasteleyn's Theorem and Arbitrary Graphs

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.23247openalex-snapshot
A Characterization on Pfaffian Graphs of Cartesian Product G×C2n+1
inferred← citeshttps://doi.org/10.1007/s10878-012-9533-4openalex-snapshot
The Pfaffian property of Cartesian products of graphs
inferred← citeshttps://doi.org/10.1007/s40840-014-0093-xopenalex-snapshot
On the Permanental Polynomials of Matrices
inferred← citeshttps://doi.org/10.1007/s40840-016-0304-8openalex-snapshot
Tricyclic Oriented Graphs with Maximal Skew Energy
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.2012.04.007openalex-snapshot
Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
inferred← citeshttps://doi.org/10.1016/j.dam.2012.10.032openalex-snapshot
On the number of perfect matchings of line graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.03.021openalex-snapshot
On the skew-permanental polynomials of orientation graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113427openalex-snapshot
On the dimer problem of the vertex-edge graph of a cubic graph
inferred← citeshttps://doi.org/10.1016/j.ipl.2014.09.026openalex-snapshot
A new lower bound for the number of perfect matchings of line graph
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/s0196-8858(03)00097-6openalex-snapshot
Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians
inferred← citeshttps://doi.org/10.1023/b:jomc.0000033254.54822.f8openalex-snapshot
On the Permanental Polynomials of Some Graphs
inferred← citeshttps://doi.org/10.1142/s1793830912500267openalex-snapshot
PERFECT MATCHINGS AND GENUS OF SOME CARTESIAN PRODUCTS OF 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.37236/11141openalex-snapshot
Enumeration of Perfect Matchings of the Cartesian Products of Graphs
inferred← citeshttps://doi.org/10.37236/1122openalex-snapshot
Parity Versions of 2-Connectedness
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/1961openalex-snapshot
Even Bonds of Prescribed Directed Parity
inferred← citeshttps://doi.org/10.37236/2864openalex-snapshot
On the Skew Spectra of Cartesian Products of Graphs
inferred← citeshttps://doi.org/10.37236/4330openalex-snapshot
The Parity of a Thicket
inferred← citeshttps://doi.org/10.48550/arxiv.1304.5707openalex-snapshot
A survey on the skew energy of oriented graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2106.02919openalex-snapshot
Solving the dimer problem of the vertex-edge graph of a cubic graph
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.