On the public citation graph

Über iterierte Clique-Graphen

https://doi.org/10.1007/bf02992818
0 signed · 81 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.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.10496openalex-snapshot
Self‐clique graphs and matrix permutations
inferred← citeshttps://doi.org/10.1002/jgt.20442openalex-snapshot
Biclique graphs and biclique matrices
inferred← citeshttps://doi.org/10.1002/jgt.21666openalex-snapshot
On the Iterated Biclique Operator
inferred← citeshttps://doi.org/10.1002/jgt.21772openalex-snapshot
The Images of the Clique Operator and Its Square are Different
inferred← citeshttps://doi.org/10.1002/jgt.22622openalex-snapshot
Clique‐convergence is undecidable for automatic graphs
inferred← citeshttps://doi.org/10.1002/jgt.22775openalex-snapshot
On the edge‐biclique graph and the iterated edge‐biclique operator
inferred← citeshttps://doi.org/10.1002/jgt.3190030402openalex-snapshot
A bibliography of graph equations
inferred← citeshttps://doi.org/10.1002/jgt.3190100204openalex-snapshot
On iterated clique graphs with increasing diameters
inferred← citeshttps://doi.org/10.1002/jgt.3190180308openalex-snapshot
A common generalization of line graphs and clique graphs
inferred← citeshttps://doi.org/10.1002/net.3230230308openalex-snapshot
An upper bound on the number of cliques in a graph
inferred← citeshttps://doi.org/10.1007/0-387-22444-0_5openalex-snapshot
A Survey on Clique Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/bf01098364openalex-snapshot
The maximum clique problem
inferred← citeshttps://doi.org/10.1007/bf01198228openalex-snapshot
Homology of the line graph and of related graph-valued functions
inferred← citeshttps://doi.org/10.1007/bf01793007openalex-snapshot
On clique convergent graphs
inferred← citeshttps://doi.org/10.1007/bf03192385openalex-snapshot
Computational aspects of the Helly property: a survey
inferred← citeshttps://doi.org/10.1007/bf03353003openalex-snapshot
A Family of Clique Divergent Graphs with Linear Growth
inferred← citeshttps://doi.org/10.1007/s00026-013-0204-7openalex-snapshot
Discrete Morse Theory and the Homotopy Type of Clique Graphs
inferred← citeshttps://doi.org/10.1007/s00026-023-00665-zopenalex-snapshot
On the Homotopy Type of the Iterated Clique Graphs of Low Degree
inferred← citeshttps://doi.org/10.1007/s00373-007-0756-6openalex-snapshot
Biclique-Helly Graphs
inferred← citeshttps://doi.org/10.1007/s00454-011-9357-5openalex-snapshot
Strong Homotopy Types, Nerves and Collapses
inferred← citeshttps://doi.org/10.1007/s10107-005-0651-yopenalex-snapshot
On Balanced Graphs
inferred← citeshttps://doi.org/10.1007/s10479-008-0392-4openalex-snapshot
NP-hardness of the recognition of coordinated graphs
inferred← citeshttps://doi.org/10.1007/s40590-022-00434-7openalex-snapshot
Collapsibility and homological properties of $$\mathfrak {I}$$-contractible transformations
inferred← citeshttps://doi.org/10.1007/s40590-022-00438-3openalex-snapshot
On the clique behavior of graphs of low degree
inferred← citeshttps://doi.org/10.1007/s44425-025-00021-8openalex-snapshot
When Do Graph Covers Preserve the Clique Dynamics of Infinite Graphs?
inferred← citeshttps://doi.org/10.1016/0012-365x(85)90077-9openalex-snapshot
The maximum number of cliques in dense graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00083-uopenalex-snapshot
A characterization of graphs G with G ≈ K2(G)
inferred← citeshttps://doi.org/10.1016/0095-8956(74)90084-7openalex-snapshot
On clique-critical graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(84)90059-5openalex-snapshot
Clique graphs of time graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90004-4openalex-snapshot
Clique graphs and Helly graphs
inferred← citeshttps://doi.org/10.1016/0097-3165(91)90044-hopenalex-snapshot
Superextensions and the depth of median graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(85)90061-7openalex-snapshot
Applications of edge coverings by cliques
inferred← citeshttps://doi.org/10.1016/b978-0-12-804295-3.50008-5openalex-snapshot
The Use of Retractions in the Fixed Point Theory for Ordered Sets
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.2007.05.048openalex-snapshot
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2007.05.057openalex-snapshot
On hereditary clique-Helly self-clique graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.01.019openalex-snapshot
The clique operator on circular-arc graphs
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.2013.04.013openalex-snapshot
Characterization of classical graph classes by weighted clique graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.07.022openalex-snapshot
Almost every graph is divergent under the biclique operator
inferred← citeshttps://doi.org/10.1016/j.dam.2016.01.013openalex-snapshot
On self-clique shoal graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2019.06.025openalex-snapshot
Two infinite families of critical clique–Helly 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.2003.11.010openalex-snapshot
A hierarchy of self-clique graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2003.12.011openalex-snapshot
Dismantlings and iterated clique graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2006.01.016openalex-snapshot
Self-clique Helly circular-arc 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.12.047openalex-snapshot
The clique operator on matching and chessboard graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2008.03.007openalex-snapshot
On self-clique graphs with given clique sizes, II
inferred← citeshttps://doi.org/10.1016/j.disc.2015.08.018openalex-snapshot
On self-clique graphs with triangular cliques
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.113230openalex-snapshot
On the clique behavior and Hellyness of the complements of regular graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2006.04.012openalex-snapshot
Posets, clique graphs and their homotopy type
inferred← citeshttps://doi.org/10.1016/j.ejc.2008.05.005openalex-snapshot
On expansive graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2008.01.049openalex-snapshot
Random Graphs, Retractions and Clique Graphs
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.entcs.2019.08.051openalex-snapshot
On the Iterated Edge-Biclique Operator
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.02.017openalex-snapshot
Faster recognition of clique-Helly and hereditary clique-Helly graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.01.018openalex-snapshot
The complexity of clique graph recognition
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00138-8openalex-snapshot
On clique divergent graphs with linear growth
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00266-2openalex-snapshot
Whitney triangulations, local girth and iterated clique graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00502-2openalex-snapshot
The icosahedron is clique divergent
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00085-xopenalex-snapshot
On clique-complete graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00257-xopenalex-snapshot
Clique divergent graphs with unbounded sequence of diameters
inferred← citeshttps://doi.org/10.1016/s0012-365x(99)00286-1openalex-snapshot
On self-clique graphs with given clique sizes
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00378-0openalex-snapshot
Clique divergent clockwork graphs and partial orders
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00028-1openalex-snapshot
Recognizing clique graphs of directed and rooted path graphs
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00212-4openalex-snapshot
Clique Divergent Clockwork Graphs and Partial Orders
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00253-7openalex-snapshot
A sufficient condition for self-clique graphs
inferred← citeshttps://doi.org/10.1080/09720529.2010.10698314openalex-snapshot
Signed intersection graphs
inferred← citeshttps://doi.org/10.2140/gt.2025.29.1openalex-snapshot
Helly groups
inferred← citeshttps://doi.org/10.21711/231766362003/rmc2510openalex-snapshot
Recognizing self-clique graphs
inferred← citeshttps://doi.org/10.21711/231766362010/rmc392openalex-snapshot
On weighted clique graphs
inferred← citeshttps://doi.org/10.3103/s0005105523040039openalex-snapshot
Structural Similarity of Objects Represented by Ordinary Graphs
inferred← citeshttps://doi.org/10.35537/10915/2331openalex-snapshot
Sobre grafos cubridores de los grafos de comparabilidad
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
inferred← citeshttps://doi.org/10.46298/dmtcs.440openalex-snapshot
On hereditary Helly classes of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1708.09686openalex-snapshot
Structural properties of biclique graphs and the distance formula
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.