On the public citation graph

On path-pairability in the Cartesian product of graphs

0 signed · 17 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.3230220702openalex-snapshot
Networks communicating for each pairing of terminals
inferredcites →https://doi.org/10.1007/bf01271707openalex-snapshot
Three-regular path pairable graphs
inferredcites →https://doi.org/10.1007/s10998-016-0113-8openalex-snapshot
On linkedness in the Cartesian product of graphs
inferredcites →https://doi.org/10.1016/j.disc.2005.11.010openalex-snapshot
Connectivity of Cartesian product graphs
inferredcites →https://doi.org/10.1016/j.disc.2014.08.011openalex-snapshot
Note on the diameter of path-pairable graphs
inferredcites →https://doi.org/10.1016/s0096-3003(98)10041-3openalex-snapshot
On connectivity of the Cartesian product of two graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s00373-019-02099-yopenalex-snapshot
On the Maximum Diameter of Path-Pairable Graphs
inferred← citeshttps://doi.org/10.1007/s10998-021-00381-2openalex-snapshot
Path-pairability of infinite planar grids
inferred← citeshttps://doi.org/10.1007/s40879-018-0306-1openalex-snapshot
On path-pairability of the finite grids
inferred← citeshttps://doi.org/10.1016/j.dam.2017.11.014openalex-snapshot
The minimum size of graphs satisfying cut conditions
inferred← citeshttps://doi.org/10.1016/j.dam.2020.12.003openalex-snapshot
The terminal-pairability problem in complete bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2017.01.014openalex-snapshot
Note on terminal-pairability in complete grid graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.05.001openalex-snapshot
Linkage on the infinite grid
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.1080/17445760.2019.1659259openalex-snapshot
Cyclic vertex-connectivity of Cartesian product graphs
inferred← citeshttps://doi.org/10.37236/7291openalex-snapshot
On the Maximum Degree of Path-Pairable Planar 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.