On the public citation graph

Line graphs of triangleless graphs and iterated clique graphs

https://doi.org/10.1007/bfb0067365
0 signed · 54 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/bf01904834openalex-snapshot
The interchange graph of a finite graph
inferredcites →https://doi.org/10.1007/bfb0059415openalex-snapshot
Recent Trends in Graph Theory
inferredcites →https://doi.org/10.1007/bfb0059433openalex-snapshot
Graphs of (0,1)-matrices
inferredcites →https://doi.org/10.1214/aoms/1177703593openalex-snapshot
On the Line Graph of the Complete Bipartite Graph
inferredcites →https://doi.org/10.1214/aoms/1177704179openalex-snapshot
On the Line-Graph of the Complete Bigraph
inferredcites →https://doi.org/10.1214/aoms/1177705914openalex-snapshot
On the Uniqueness of the Triangular Association Scheme
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/1097-0118(200012)35:4<257::aid-jgt3>3.0.co;2-4openalex-snapshot
Clique-inverse graphs ofK3-free andK4-free graphs
inferred← citeshttps://doi.org/10.1002/jgt.21666openalex-snapshot
On the Iterated Biclique Operator
inferred← citeshttps://doi.org/10.1002/jgt.22544openalex-snapshot
On clique‐inverse graphs of graphs with bounded clique number
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.3190050416openalex-snapshot
On Graphs Without Multicliqual Edges
inferred← citeshttps://doi.org/10.1002/jgt.3190100204openalex-snapshot
On iterated clique graphs with increasing diameters
inferred← citeshttps://doi.org/10.1007/0-387-22444-0_5openalex-snapshot
A Survey on Clique Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-81386-4_11openalex-snapshot
Characterizations of Line Digraphs
inferred← citeshttps://doi.org/10.1007/978-3-030-81386-4_3openalex-snapshot
Characterizations of Line Graphs
inferred← citeshttps://doi.org/10.1007/s00373-011-1034-1openalex-snapshot
Upper Bounds for the Rainbow Connection Numbers of Line Graphs
inferred← citeshttps://doi.org/10.1007/s00373-012-1243-2openalex-snapshot
Rainbow Connections of Graphs: A Survey
inferred← citeshttps://doi.org/10.1007/s10878-020-00541-zopenalex-snapshot
Computation and algorithm for the minimum k-edge-connectivity of graphs
inferred← citeshttps://doi.org/10.1007/s11083-004-0023-xopenalex-snapshot
Characterizing Flag Graphs and Induced Subgraphs of Cartesian Product 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/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.akcej.2016.07.002openalex-snapshot
On clique convergence of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2011.10.024openalex-snapshot
Maximal independent sets in caterpillar 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.05.002openalex-snapshot
On basic chordal graphs and some of its subclasses
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.disc.2003.10.023openalex-snapshot
The clique operator on cographs and serial 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.ejc.2008.05.005openalex-snapshot
On expansive graphs
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.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/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(98)00257-xopenalex-snapshot
Clique divergent graphs with unbounded sequence of diameters
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(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.1016/s1571-0653(04)00212-4openalex-snapshot
Clique Divergent Clockwork Graphs and Partial Orders
inferred← citeshttps://doi.org/10.1017/s1446788700024848openalex-snapshot
A result on iterated clique graphs
inferred← citeshttps://doi.org/10.20429/tag.2017.000103openalex-snapshot
An Updated Survey on Rainbow Connections of Graphs- A Dynamic Survey
inferred← citeshttps://doi.org/10.21711/231766362010/rmc392openalex-snapshot
On weighted clique graphs
inferred← citeshttps://doi.org/10.24275/uami.w3763697hopenalex-snapshot
Sobre la computabilidad del clan-comportamiento
inferred← citeshttps://doi.org/10.48550/arxiv.1408.6063openalex-snapshot
Almost every graph is divergent under the biclique operator
inferred← citeshttps://doi.org/10.48550/arxiv.1508.03971openalex-snapshot
On Clique Convergences of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1901.06100openalex-snapshot
Extremality and Sharp Bounds for the $k$-edge-connectivity of Graphs
inferred← citeshttps://doi.org/10.6028/jres.080b.049openalex-snapshot
A note on pseudointersection 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.