On the public citation graph

Towards a theory of forcibly hereditary P-graphic sequences

https://doi.org/10.1007/bfb0092289
0 signed · 23 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/bfb0092288openalex-snapshot
A survey of the theory of potentially P-graphic and forcibly P-graphic degree sequences
inferredcites →https://doi.org/10.1016/0012-365x(72)90006-4openalex-snapshot
Normal hypergraphs and the perfect graph conjecture
inferredcites →https://doi.org/10.1016/0012-365x(73)90037-xopenalex-snapshot
Algorithms for constructing graphs and digraphs with given valences and factors
inferredcites →https://doi.org/10.1016/s0012-365x(76)80008-8openalex-snapshot
On the perfect graph conjecture
inferredcites →https://doi.org/10.1016/s0924-6509(09)x7013-3openalex-snapshot
Graphs and Hypergraphs
inferredcites →https://doi.org/10.1112/blms/6.2.218bopenalex-snapshot
GRAPHS AND HYPERGRAPHS
inferredcites →https://doi.org/10.4153/cjm-1965-016-2openalex-snapshot
Some Properties of Graphs with Multiple Edges

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.20270openalex-snapshot
Graph classes characterized both by forbidden subgraphs and degree sequences
inferred← citeshttps://doi.org/10.1007/978-3-030-30229-0_7openalex-snapshot
Recent Progress on Well-Quasi-ordering Graphs
inferred← citeshttps://doi.org/10.1007/978-3-032-28691-8_5openalex-snapshot
Degree Realization with Minimum Dominating Set
inferred← citeshttps://doi.org/10.1007/bf01070234openalex-snapshot
Graphs and degree sequences. I
inferred← citeshttps://doi.org/10.1007/bf01082602openalex-snapshot
Graphs and degree sequences. II
inferred← citeshttps://doi.org/10.1007/bfb0092288openalex-snapshot
A survey of the theory of potentially P-graphic and forcibly P-graphic degree sequences
inferred← citeshttps://doi.org/10.1007/s11786-011-0072-7openalex-snapshot
Supra-Hereditary Properties of Hypergraphs
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90184-1openalex-snapshot
On forcibly hereditary p-graphical sequences
inferred← citeshttps://doi.org/10.1016/j.disc.2013.03.004openalex-snapshot
Two short proofs of the bounded case of S.B. Rao’s degree sequence conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2011.09.002openalex-snapshot
A semigroup proof of the bounded degree case of S.B. Raoʼs Conjecture on degree sequences and a bipartite analogue
inferred← citeshttps://doi.org/10.1016/j.jctb.2013.12.003openalex-snapshot
Rao's degree sequence conjecture
inferred← citeshttps://doi.org/10.1016/s0167-5060(06)80022-1openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1137/16m1109643openalex-snapshot
Stability of the Potential Function
inferred← citeshttps://doi.org/10.1201/b16132-8openalex-snapshot
Computer Representations of Graphs
inferred← citeshttps://doi.org/10.37236/3683openalex-snapshot
On Fractional Realizations of Graph Degree Sequences
inferred← citeshttps://doi.org/10.48550/arxiv.1306.3508openalex-snapshot
Labelled version of the almost bounded case of S. B. Rao's degree sequence conjecture
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.