On the public citation graph

Three-regular path pairable graphs

0 signed · 18 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/j.1538-7305.1979.tb02972.xopenalex-snapshot
On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
inferredcites →https://doi.org/10.1002/net.3230220702openalex-snapshot
Networks communicating for each pairing of terminals
inferredcites →https://doi.org/10.1007/bf01350174openalex-snapshot
Eine Verallgemeinerung desn-fachen Zusammenhangs f�r Graphen
inferredcites →https://doi.org/10.1007/bf01787639openalex-snapshot
A sufficient condition for graphs to be weaklyk-linked
inferredcites →https://doi.org/10.1007/bf02392606openalex-snapshot
Die Theorie der regulären graphs
inferredcites →https://doi.org/10.1112/plms/s3-20.1.144openalex-snapshot
On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
inferredcites →https://doi.org/10.1137/0204030openalex-snapshot
Parallelism in Comparison Problems
inferredcites →https://doi.org/10.1137/0206022openalex-snapshot
Superconcentrators

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.3230220702openalex-snapshot
Networks communicating for each pairing of terminals
inferred← citeshttps://doi.org/10.1016/j.dam.2020.06.017openalex-snapshot
Note on the bisection width of cubic graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2014.08.011openalex-snapshot
Note on the diameter of path-pairable graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.106080openalex-snapshot
Minimal 2-connected graphs satisfying the even cut condition
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.12.007openalex-snapshot
Terminal-pairability in complete bipartite graphs with non-bipartite demands
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00028-6openalex-snapshot
A communication problem and directed triple systems
inferred← citeshttps://doi.org/10.1109/cse.2014.352openalex-snapshot
The Social Feature-Based Priority Relation Graph of Mobile Social Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1401.7931openalex-snapshot
Note on the Diameter of Path-Pairable Graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1888openalex-snapshot
On path-pairability in the Cartesian product of graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2114openalex-snapshot
The path-pairability number of products of stars
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.