On the public citation graph

Graphs and their degree sequences: A survey

https://doi.org/10.1007/bfb0070380
0 signed · 73 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/net.3230030303openalex-snapshot
On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)
inferredcites →https://doi.org/10.1002/net.3230080202openalex-snapshot
Unicyclic realizability of a degree list
inferredcites →https://doi.org/10.1002/sapm197655187openalex-snapshot
Construction of a Maximally Edge‐Connected Graph with Prescribed Degrees
inferredcites →https://doi.org/10.1007/978-3-642-65759-7openalex-snapshot
Map Color Theorem
inferredcites →https://doi.org/10.1007/bf01234967openalex-snapshot
Selbstkomplement�re Graphen
inferredcites →https://doi.org/10.1007/bf02020548openalex-snapshot
Valencies of graphs with 1-factors
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/0012-365x(73)90068-xopenalex-snapshot
The k-factor conjecture is true
inferredcites →https://doi.org/10.1016/0012-365x(76)90048-0openalex-snapshot
Relations between graphs and integer-pair sequences
inferredcites →https://doi.org/10.1016/0012-365x(76)90078-9openalex-snapshot
A method in graph theory
inferredcites →https://doi.org/10.1016/0095-8956(71)90016-5openalex-snapshot
Pancyclic graphs I
inferredcites →https://doi.org/10.1016/0095-8956(71)90030-xopenalex-snapshot
On the planarity of regular incidence sequences
inferredcites →https://doi.org/10.1016/0095-8956(72)90020-2openalex-snapshot
On Hamilton's ideals
inferredcites →https://doi.org/10.1016/0095-8956(72)90055-xopenalex-snapshot
On factorable degree sequences
inferredcites →https://doi.org/10.1016/0095-8956(73)90057-9openalex-snapshot
Une condition suffisante d'existence d'un circuit hamiltonien dans un graphe oriente
inferredcites →https://doi.org/10.1016/0095-8956(74)90043-4openalex-snapshot
Pancyclic graphs and a conjecture of Bondy and Chvátal
inferredcites →https://doi.org/10.1016/0095-8956(74)90058-6openalex-snapshot
The strongest monotone degree condition for n-connectedness of a graph
inferredcites →https://doi.org/10.1016/0095-8956(76)90064-2openalex-snapshot
Pancyclic graphs II
inferredcites →https://doi.org/10.1016/0095-8956(76)90068-xopenalex-snapshot
The degree sequences of self-complementary graphs
inferredcites →https://doi.org/10.1016/0097-3165(71)90047-1openalex-snapshot
Symmetric Gobos in a finite projective plane
inferredcites →https://doi.org/10.1016/s0021-9800(70)80037-0openalex-snapshot
A sufficient condition for hamiltonian connectedness
inferredcites →https://doi.org/10.1016/s0924-6509(09)x7013-3openalex-snapshot
Graphs and Hypergraphs
inferredcites →https://doi.org/10.1017/s0305004100023720openalex-snapshot
A family of cubical graphs
inferredcites →https://doi.org/10.1080/00029890.1975.11993953openalex-snapshot
Graph Imbedding Problems
inferredcites →https://doi.org/10.1090/s0002-9939-1966-0188103-0openalex-snapshot
On Hamiltonian Circuits in Finite Graphs
inferredcites →https://doi.org/10.1109/tct.1970.1083100openalex-snapshot
Survivable communication networks and the terminal capacity matrix
inferredcites →https://doi.org/10.1111/j.1749-6632.1979.tb32774.xopenalex-snapshot
DEGREES AND CYCLES IN GRAPHS
inferredcites →https://doi.org/10.1112/plms/s3-2.1.69openalex-snapshot
Some Theorems on Abstract Graphs
inferredcites →https://doi.org/10.1112/s0025579300002369openalex-snapshot
A sufficient condition for n ‐connectedness of graphs
inferredcites →https://doi.org/10.1137/0110037openalex-snapshot
On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
inferredcites →https://doi.org/10.1137/0111010openalex-snapshot
On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness
inferredcites →https://doi.org/10.1137/0126011openalex-snapshot
On the Existence of Graphs with Prescribed Degrees and Connectivity
inferredcites →https://doi.org/10.1137/0126029openalex-snapshot
A Note on n -Edge-Connectivity
inferredcites →https://doi.org/10.1137/0132048openalex-snapshot
On Planar Graphical Degree Sequences
inferredcites →https://doi.org/10.21136/cpm.1955.108220openalex-snapshot
A remark on the existence of finite graphs
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY
inferredcites →https://doi.org/10.2140/pjm.1970.33.203openalex-snapshot
Existence of triconnected graphs with prescribed degrees
inferredcites →https://doi.org/10.2307/2308928openalex-snapshot
Note on Hamilton Circuits
inferredcites →https://doi.org/10.2307/2372318openalex-snapshot
Partitions and Their Representative Graphs
inferredcites →https://doi.org/10.2307/3611937openalex-snapshot
On Certain Polyhedra
inferredcites →https://doi.org/10.4153/cjm-1963-071-3openalex-snapshot
The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
inferredcites →https://doi.org/10.4153/cmb-1966-016-xopenalex-snapshot
On Sums of Valencies in Planar Graphs
inferredcites →https://doi.org/10.5486/pmd.1962.9.3-4.11openalex-snapshot
Über selbstkomplementäre Graphen
inferredcites →https://doi.org/10.6028/jres.068b.013openalex-snapshot
Existence of k-edge connected ordinary graphs with prescribed degrees

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.22020openalex-snapshot
Characterization of Digraphic Sequences with Strongly Connected Realizations
inferred← citeshttps://doi.org/10.1002/jgt.3190040210openalex-snapshot
Line‐graphical degree sequences
inferred← citeshttps://doi.org/10.1007/978-3-319-94776-1_33openalex-snapshot
An Efficiently Recognisable Subset of Hypergraphic Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-45278-9_26openalex-snapshot
Degree Sequences of PageRank Uniform Graphs and Digraphs with Prime Outdegrees
inferred← citeshttps://doi.org/10.1007/bf01068560openalex-snapshot
A property of adjacency matrices of realizations of pair sequences
inferred← citeshttps://doi.org/10.1007/bf01069217openalex-snapshot
Graphs and degree sequences: Canonical decomposition
inferred← citeshttps://doi.org/10.1007/bf01070234openalex-snapshot
Graphs and degree sequences. I
inferred← citeshttps://doi.org/10.1007/bf01072106openalex-snapshot
Decomposition of graphs
inferred← citeshttps://doi.org/10.1007/bf01082602openalex-snapshot
Graphs and degree sequences. II
inferred← citeshttps://doi.org/10.1007/bf01141783openalex-snapshot
Sequences of degrees of edges of self-complementary graphs
inferred← citeshttps://doi.org/10.1007/bf01157039openalex-snapshot
Potentially 2-connected integerpair sequences
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/s00373-013-1307-yopenalex-snapshot
A Degree Sequence Variant of Graph Ramsey Numbers
inferred← citeshttps://doi.org/10.1007/s00493-015-2986-1openalex-snapshot
On the sum necessary to ensure that a degree sequence is potentially H-graphic
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00158-5openalex-snapshot
On existence of hypergraphs with prescribed edge degree profile
inferred← citeshttps://doi.org/10.1016/0016-0032(80)90013-7openalex-snapshot
Subgraphs and Their Degree Sequences of a Digraph
inferred← citeshttps://doi.org/10.1016/0024-3795(93)90430-vopenalex-snapshot
The structure matrix of the class of r-multigraphs with a prescribed degree sequence
inferred← citeshttps://doi.org/10.1016/j.disc.2014.03.025openalex-snapshot
On the existence of super edge-connected graphs with prescribed degrees
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113599openalex-snapshot
Vertex degrees close to the average degree
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.103061openalex-snapshot
On the potential function of an arbitrary graph H
inferred← citeshttps://doi.org/10.1109/bigdata.2017.8258316openalex-snapshot
A parallel algorithm for generating a random graph with a prescribed degree sequence
inferred← citeshttps://doi.org/10.1137/140987912openalex-snapshot
Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem
inferred← citeshttps://doi.org/10.1186/s13660-017-1544-3openalex-snapshot
Degree sequence for k-arc strongly connected multiple digraphs
inferred← citeshttps://doi.org/10.14279/depositonce-4415openalex-snapshot
Degree-constrained editing of small-degree graphs
inferred← citeshttps://doi.org/10.1515/ausi-2015-0007openalex-snapshot
Recognition of split-graphic sequences
inferred← citeshttps://doi.org/10.33915/etd.5104openalex-snapshot
A Study of Arc Strong Connectivity of Digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1203.4611openalex-snapshot
On the Sum Neccesary to Ensure that a Degree Sequence is Potentially H-Graphic
inferred← citeshttps://doi.org/10.48550/arxiv.2009.12697openalex-snapshot
Modifying a Graph's Degree Sequence and the Testablity of Degree Sequence Properties
inferred← citeshttps://doi.org/10.48550/arxiv.2103.02283openalex-snapshot
Pseudoline arrangement graphs: degree sequences and eccentricities
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.