On the public citation graph

Graphs with Induced-Saturation Number Zero

https://doi.org/10.37236/5095
0 signed · 17 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.1002/jgt.3190100209openalex-snapshot
Saturated graphs with minimal number of edges
inferredcites →https://doi.org/10.1016/0012-365x(78)90178-4openalex-snapshot
Trivially perfect graphs
inferredcites →https://doi.org/10.1016/j.disc.2012.06.015openalex-snapshot
Induced saturation number
inferredcites →https://doi.org/10.1016/s0021-9800(70)80019-9openalex-snapshot
Characterizations of derived graphs
inferredcites →https://doi.org/10.1016/s0167-5060(08)70731-3openalex-snapshot
Aggregation of Inequalities in Integer Programming
inferredcites →https://doi.org/10.1090/s0002-9939-1962-0172273-0openalex-snapshot
The Comparability Graph of a Tree
inferredcites →https://doi.org/10.1201/b12336-12openalex-snapshot
Introduction to Graph Theory
inferredcites →https://doi.org/10.2307/2311408openalex-snapshot
A Problem in Graph Theory
inferredcites →https://doi.org/10.37236/41openalex-snapshot
A Survey of Minimum Saturated Graphs
inferredcites →https://doi.org/10.4007/annals.2006.164.51openalex-snapshot
The strong perfect graph theorem
inferredcites →https://doi.org/10.4064/fm-51-1-45-64openalex-snapshot
Representation of a finite graph by a set of intervals on the real line

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4814552openalex-extracted
C_4-Induced-Saturated Graphs
inferred← citeshttps://doi.org/10.1007/s00026-025-00764-zopenalex-snapshot
Induced Saturation of the Poset $$2C_2$$
inferred← citeshttps://doi.org/10.1016/j.disc.2019.01.006openalex-snapshot
Induced saturation of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2019.111641openalex-snapshot
Induced saturation of P6
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103204openalex-snapshot
On induced saturation for paths
inferred← citeshttps://doi.org/10.37236/9579openalex-snapshot
$P_{n}$-Induced-Saturated Graphs Exist for all $n \geqslant 6$
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.