On the public citation graph

The cohesive strength of graphs

https://doi.org/10.1007/bfb0060120
0 signed · 27 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.1016/s0021-9800(68)80081-xopenalex-snapshot
An inequality for the chromatic number of a graph
inferredcites →https://doi.org/10.1090/coll/038openalex-snapshot
Theory of Graphs
inferredcites →https://doi.org/10.1137/0109047openalex-snapshot
Multi-Terminal Network Flows
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY

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.20032openalex-snapshot
Improved bounds for the chromatic number of a graph
inferred← citeshttps://doi.org/10.1002/net.3230020104openalex-snapshot
Bounded color functions on graphs
inferred← citeshttps://doi.org/10.1006/geno.2000.6187openalex-snapshot
An Algorithm for Clustering cDNA Fingerprints
inferred← citeshttps://doi.org/10.1007/978-3-030-01174-1_33openalex-snapshot
A New Clustering Algorithm Based on Graph Connectivity
inferred← citeshttps://doi.org/10.1007/978-3-319-74180-2_5openalex-snapshot
Probabilistic Properties of Highly Connected Random Geometric Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-39884-4_3openalex-snapshot
Communities in Graphs
inferred← citeshttps://doi.org/10.1007/bfb0070394openalex-snapshot
Subgraph connectivity numbers of a graph
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/s00373-022-02468-0openalex-snapshot
The Extremal Sizes of Arc-Maximal (k, l)-Digraphs
inferred← citeshttps://doi.org/10.1007/s00373-025-02961-2openalex-snapshot
On the Sizes of Bi-k-Edge-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/j.dam.2019.04.007openalex-snapshot
Probabilistic properties of highly connected random geometric graphs
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.disc.2016.04.007openalex-snapshot
On the lower bound of k -maximal digraphs
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.05.041openalex-snapshot
Finding maximum subgraphs with relatively large vertex connectivity
inferred← citeshttps://doi.org/10.1016/j.jvlc.2005.10.003openalex-snapshot
Clustering graphs for visualization via node similarities
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.1016/s0020-0190(00)00142-3openalex-snapshot
A clustering algorithm based on graph connectivity
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.1109/ideas.2003.1214919openalex-snapshot
Identification of clusters in the Web graph based on link topology
inferred← citeshttps://doi.org/10.1137/0122040openalex-snapshot
k -Components, Clusters and Slicings in Graphs
inferred← citeshttps://doi.org/10.1145/2649387.2649416openalex-snapshot
Large highly connected clusters in protein-protein interaction networks
inferred← citeshttps://doi.org/10.1145/299432.299483openalex-snapshot
An algorithm for clustering cDNAs for gene expression analysis
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.