On the public citation graph

On clique convergent graphs

https://doi.org/10.1007/bf01793007
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.1007/bf02992818openalex-snapshot
Über iterierte Clique-Graphen
inferredcites →https://doi.org/10.1016/0012-365x(92)90270-popenalex-snapshot
Convergence of iterated clique graphs
inferredcites →https://doi.org/10.1016/0095-8956(84)90059-5openalex-snapshot
Clique graphs of time graphs
inferredcites →https://doi.org/10.1016/0095-8956(91)90004-4openalex-snapshot
Clique graphs and Helly 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/0-387-22444-0_5openalex-snapshot
A Survey on Clique Graphs
inferred← citeshttps://doi.org/10.1007/bf03192385openalex-snapshot
Computational aspects of the Helly property: a survey
inferred← citeshttps://doi.org/10.1007/s13173-011-0054-2openalex-snapshot
Contributions of Jayme Luiz Szwarcfiter to graph theory and computer science
inferred← citeshttps://doi.org/10.1016/j.dam.2005.09.002openalex-snapshot
The clique operator on graphs with few P4 's
inferred← citeshttps://doi.org/10.1016/j.dam.2013.02.003openalex-snapshot
Edge contraction and edge removal on iterated clique graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.02.006openalex-snapshot
On the termination of some biclique operators on multipartite graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2003.10.023openalex-snapshot
The clique operator on cographs and serial graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.06.021openalex-snapshot
Equivariant collapses and the homotopy type of iterated clique graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.004openalex-snapshot
Contractibility and the clique graph operator
inferred← citeshttps://doi.org/10.1016/j.disc.2008.07.032openalex-snapshot
Cube intersection concepts in median graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2017.07.007openalex-snapshot
On strong graph bundles
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112873openalex-snapshot
Clique dynamics of locally cyclic graphs with δ ≥ 6
inferred← citeshttps://doi.org/10.1016/j.endm.2008.01.046openalex-snapshot
Iterated Clique Graphs and Contractibility
inferred← citeshttps://doi.org/10.1016/j.endm.2009.11.056openalex-snapshot
On the clique behavior of circulants with three small jumps
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.01.018openalex-snapshot
The complexity of clique graph recognition
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.009openalex-snapshot
Termination of the iterated strong-factor operator on multipartite graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00085-xopenalex-snapshot
On clique-complete graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00379-2openalex-snapshot
Distances and diameters on iterated clique graphs
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00210-0openalex-snapshot
Distances and Diameters on Iterated Clique Graphs
inferred← citeshttps://doi.org/10.1590/s0104-65002006000200002openalex-snapshot
Computational aspects of the Helly property: a survey
inferred← citeshttps://doi.org/10.24275/uami.w3763697hopenalex-snapshot
Sobre la computabilidad del clan-comportamiento
inferred← citeshttps://doi.org/10.35537/10915/2560openalex-snapshot
El operador clique y los grafos planares
inferred← citeshttps://doi.org/10.37236/38openalex-snapshot
Complexity Aspects of the Helly Property: Graphs and Hypergraphs
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.