On the public citation graph

https://doi.org/10.2139/ssrn.4658349

0 signed · 19 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.1002/net.20440openalex-extracted
Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
inferredcites →https://doi.org/10.1007/978-1-84628-970-5openalex-extracted
Graph Theory
inferredcites →https://doi.org/10.1007/s00373-012-1259-7openalex-extracted
On Perfect k-Matchings
inferredcites →https://doi.org/10.1007/s10878-016-0077-xopenalex-extracted
Fractional matching preclusion of graphs
inferredcites →https://doi.org/10.1016/j.amc.2022.127638openalex-extracted
Integer k -matching preclusion of twisted cubes and ( n,s )-star graphs
inferredcites →https://doi.org/10.1016/j.dam.2012.03.014openalex-extracted
Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
inferredcites →https://doi.org/10.1016/j.dam.2017.08.013openalex-extracted
Integer k -matchings of graphs
inferredcites →https://doi.org/10.1016/j.dam.2021.03.005openalex-extracted
Integer k -matchings of graphs: k -Berge–Tutte formula, k -factor-critical graphs and k -barriers
inferredcites →https://doi.org/10.1016/j.parco.2004.10.002openalex-extracted
Fault hamiltonicity of augmented cubes
inferredcites →https://doi.org/10.1016/j.tcs.2011.08.008openalex-extracted
Strong matching preclusion
inferredcites →https://doi.org/10.1016/j.tcs.2013.05.002openalex-extracted
Strong matching preclusion for augmented cubes
inferredcites →https://doi.org/10.1016/j.tcs.2017.05.002openalex-extracted
Matching preclusion for n-dimensional torus networks
inferredcites →https://doi.org/10.1109/ipdps.2005.223openalex-extracted
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks
inferredcites →https://doi.org/10.1109/spdp.1993.395450openalex-extracted
A class of hypercube-like networks
inferredcites →https://doi.org/10.1142/s0219265910002726openalex-extracted
MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR AUGMENTED CUBES
inferredcites →https://doi.org/10.1142/s0219265919400103openalex-extracted
Fractional Matching Preclusion for Restricted Hypercube-Like Graphs
inferredcites →https://doi.org/10.23638/dmtcs-21-4-6openalex-extracted
Fractional matching preclusion for generalized augmented cubes
inferredcites →https://doi.org/10.48550/arxiv.2001.03713openalex-extracted
Fractional matching preclusion of fault Hamiltonian graphs
inferredcites →https://doi.org/10.48550/arxiv.2306.01216openalex-extracted
Integer k-matching preclusion of graphs
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.