On the public citation graph
Subgraph connectivity numbers of a graph
0 signed · 23 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.1007/978-1-4612-2972-8_4openalex-snapshot
Congruent Graphs and the Connectivity of Graphs
inferredcites →https://doi.org/10.1016/0095-8956(78)90071-0openalex-snapshot
k-Blocks and ultrablocks in graphs
inferredcites →https://doi.org/10.1016/s0021-9800(68)80081-xopenalex-snapshot
An inequality for the chromatic number of a graph
inferredcites →https://doi.org/10.1137/0122040openalex-snapshot
k -Components, Clusters and Slicings in Graphs
inferredcites →https://doi.org/10.1137/0204043openalex-snapshot
Network Flow and Testing Graph Connectivity
inferredcites →https://doi.org/10.2307/2371086openalex-snapshot
Congruent Graphs and the Connectivity of 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.3190070113openalex-snapshot
Ramsey theory for graph connectivity
inferred← citeshttps://doi.org/10.1007/s00373-019-02052-zopenalex-snapshot
On the Sizes of Vertex-k-Maximal r-Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1007/s10878-020-00522-2openalex-snapshot
On the sizes of bi-k-maximal graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(78)90071-0openalex-snapshot
k-Blocks and ultrablocks in graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00131-vopenalex-snapshot
Large survivable nets and the generalized prisms
inferred← citeshttps://doi.org/10.1016/b978-0-12-714250-0.50009-7openalex-snapshot
Graph Theoretic Techniques for Cluster Analysis Algorithms
inferred← citeshttps://doi.org/10.1016/j.dam.2020.06.003openalex-snapshot
On the extremal sizes of maximal graphs without ( k + 1 ) -connected subgraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2022.07.011openalex-snapshot
Bounding ℓ -edge-connectivity in edge-connectivity
inferred← citeshttps://doi.org/10.1016/j.jmva.2015.03.004openalex-snapshot
Sharp lower and upper bounds for the Gaussian rank of a graph
inferred← citeshttps://doi.org/10.1016/j.laa.2025.10.023openalex-snapshot
Spectral conditions for the maximum subgraph edge-connectivity of graphs
inferred← citeshttps://doi.org/10.1080/23799927.2017.1410498openalex-snapshot
Minimax properties of some density measures in graphs and digraphs
inferred← citeshttps://doi.org/10.1093/biomet/asaf045openalex-snapshot
Pseudolikelihood estimators for graphical models: existence and uniqueness
inferred← citeshttps://doi.org/10.1109/sfcs.1987.19openalex-snapshot
Determining edge connectivity in 0(nm)
inferred← citeshttps://doi.org/10.1145/2402.322385openalex-snapshot
Smallest-last ordering and clustering and graph coloring algorithms
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.