On the public citation graph
On classes of graphs defined by special cutsets of lines
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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0095-8956(71)90065-7openalex-snapshot
Graphs with forbidden subgraphs
inferredcites →https://doi.org/10.4153/cjm-1965-084-2openalex-snapshot
The Thickness of the Complete Graph
inferredcites →https://doi.org/10.5486/pmd.1966.13.1-4.15openalex-snapshot
The block-cutpoint-tree of a graph
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199905)33:3<161::aid-net1>3.0.co;2-3openalex-snapshot
On diameter of permutation graphs
inferred← citeshttps://doi.org/10.1007/bf01864155openalex-snapshot
On natural isomorphisms of cycle permutation graphs
inferred← citeshttps://doi.org/10.1007/bfb0069553openalex-snapshot
Some problems in permutation graphs
inferred← citeshttps://doi.org/10.1007/s11587-021-00589-xopenalex-snapshot
Spectra of partitioned matrices and the $${\mathcal {M}}$$-join of graphs
inferred← citeshttps://doi.org/10.1007/s12190-014-0755-8openalex-snapshot
On the geodetic number of permutation graphs
inferred← citeshttps://doi.org/10.1007/s13226-021-00027-6openalex-snapshot
Spectra of M-edge rooted product of graphs
inferred← citeshttps://doi.org/10.1007/s13226-024-00699-wopenalex-snapshot
The generalized distance spectra of the $$\mathcal {M}$$-join of graphs, II
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90007-4openalex-snapshot
On cycle permutation graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90137-5openalex-snapshot
Isomorphism classes of cycle permutation graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(74)90057-4openalex-snapshot
Color-critical graphs and hypergraphs
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90047-zopenalex-snapshot
Connectivity of generalized prisms over G
inferred← citeshttps://doi.org/10.1016/j.disc.2013.12.013openalex-snapshot
On the k -residue of disjoint unions of graphs with applications to k -independence
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73012-3openalex-snapshot
A Note on Isomorphic Generalized Prisms
inferred← citeshttps://doi.org/10.1080/03081087.2019.1709407openalex-snapshot
Spectra of M-rooted product of graphs
inferred← citeshttps://doi.org/10.1080/25742558.2020.1858560openalex-snapshot
On roman domination number of functigraph and its complement
inferred← citeshttps://doi.org/10.1109/12.67323openalex-snapshot
The twisted N-cube with application to multiprocessing
inferred← citeshttps://doi.org/10.1109/csss.2011.5974673openalex-snapshot
Supereulerian generalized prisms
inferred← citeshttps://doi.org/10.1142/s1793830912500607openalex-snapshot
ON METRIC DIMENSION OF FUNCTIGRAPHS
inferred← citeshttps://doi.org/10.21136/mb.2011.141447openalex-snapshot
Functigraphs: An extension of permutation graphs
inferred← citeshttps://doi.org/10.22199/issn.0717-6279-5454openalex-snapshot
Spectra of (M, ℳ)-corona-join 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.