On the public citation graph
Graphs and degree sequences. I
0 signed · 124 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/jgt.3190010109openalex-snapshot
Some recent results in hamiltonian graphs
inferredcites →https://doi.org/10.1002/jgt.3190020404openalex-snapshot
On the connectivity of maximal planar graphs
inferredcites →https://doi.org/10.1002/jgt.3190030308openalex-snapshot
Class of graphs with restricted neighborhoods
inferredcites →https://doi.org/10.1002/jgt.3190040210openalex-snapshot
Line‐graphical degree sequences
inferredcites →https://doi.org/10.1002/jgt.3190040308openalex-snapshot
The orders of graphs with prescribed degree sets
inferredcites →https://doi.org/10.1002/jgt.3190040405openalex-snapshot
On a conjecture on maximal planar sequences
inferredcites →https://doi.org/10.1002/jgt.3190060111openalex-snapshot
Counterexamples to randić's conjecture on distance degree sequences for trees
inferredcites →https://doi.org/10.1002/jgt.3190060407openalex-snapshot
Bipartite graphs with cycles of all even lengths
inferredcites →https://doi.org/10.1002/jgt.3190080120openalex-snapshot
Note on vertex degrees of planar graphs
inferredcites →https://doi.org/10.1002/jgt.3190090109openalex-snapshot
Rao's conjecture on self‐complementary graphs with K‐factors
inferredcites →https://doi.org/10.1002/net.3230080202openalex-snapshot
Unicyclic realizability of a degree list
inferredcites →https://doi.org/10.1002/sapm1975544283openalex-snapshot
A Note on Unigraphic Sequences
inferredcites →https://doi.org/10.1007/bf01849614openalex-snapshot
Graphs with prescribed degree sets and girth
inferredcites →https://doi.org/10.1007/bf02575684openalex-snapshot
On the existence and connectivity of a class of maximal planar graphs
inferredcites →https://doi.org/10.1007/bfb0061978openalex-snapshot
The graph of hypergraphic realisations of denumerable multisets of degrees
inferredcites →https://doi.org/10.1007/bfb0070380openalex-snapshot
Graphs and their degree sequences: A survey
inferredcites →https://doi.org/10.1007/bfb0071623openalex-snapshot
On sequences representable by Γ−-regular graphs
inferredcites →https://doi.org/10.1007/bfb0071628openalex-snapshot
Some problems concerning distance and path degree sequences
inferredcites →https://doi.org/10.1007/bfb0071640openalex-snapshot
A note on planarity and distance degree sequences
inferredcites →https://doi.org/10.1007/bfb0073123openalex-snapshot
Degree sequences of connected hypergraphs and hypertrees
inferredcites →https://doi.org/10.1007/bfb0088900openalex-snapshot
Degree sequences uniquely realisable by hypergraphs
inferredcites →https://doi.org/10.1007/bfb0091814openalex-snapshot
Connected subgraphs of the graph of multigraphic realisations of a degree sequence
inferredcites →https://doi.org/10.1007/bfb0091817openalex-snapshot
Simple and multigraphic realizations of degree sequences
inferredcites →https://doi.org/10.1007/bfb0092259openalex-snapshot
Characterization of potentially connected integer-pair sequences
inferredcites →https://doi.org/10.1007/bfb0092263openalex-snapshot
2-2 Perfect graphic degree sequences
inferredcites →https://doi.org/10.1007/bfb0092264openalex-snapshot
Characterization of forcibly outerplanar graphic sequences
inferredcites →https://doi.org/10.1007/bfb0092267openalex-snapshot
Characterization of forcibly bipartite self-complementary bipartitioned sequences
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.1007/bfb0092289openalex-snapshot
Towards a theory of forcibly hereditary P-graphic sequences
inferredcites →https://doi.org/10.1007/bfb0121193openalex-snapshot
An algorithm for finding hamiltonian circuits in certain graphs
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/0012-365x(77)90075-9openalex-snapshot
On graphical partitions and planarity
inferredcites →https://doi.org/10.1016/0012-365x(77)90157-1openalex-snapshot
Characterization of self-complementary graphs with 2-factors
inferredcites →https://doi.org/10.1016/0012-365x(78)90184-xopenalex-snapshot
On graphs with equal edge-connectivity and minimum degree
inferredcites →https://doi.org/10.1016/0012-365x(80)90035-7openalex-snapshot
Properties of unique realizations—a survey
inferredcites →https://doi.org/10.1016/0012-365x(81)90139-4openalex-snapshot
Characterization of unigraphic and unidigraphic integer-pair sequences
inferredcites →https://doi.org/10.1016/0012-365x(81)90178-3openalex-snapshot
An unresolved conjecture on nonmaximal planar graphical sequences
inferredcites →https://doi.org/10.1016/0012-365x(82)90286-2openalex-snapshot
Characterisation of potentially bipartite self-complementary bipartitioned sequences
inferredcites →https://doi.org/10.1016/0012-365x(83)90016-xopenalex-snapshot
Alternating eulerian trails with prescribed degrees in two edge-colored complete graphs
inferredcites →https://doi.org/10.1016/0012-365x(83)90035-3openalex-snapshot
Integer-pair sequences with self-complementary realizations
inferredcites →https://doi.org/10.1016/0012-365x(83)90053-5openalex-snapshot
The network flows approach for matrices with given row and column sums
inferredcites →https://doi.org/10.1016/0012-365x(83)90175-9openalex-snapshot
Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences
inferredcites →https://doi.org/10.1016/0012-365x(84)90023-2openalex-snapshot
Degree sequences of matrogenic graphs
inferredcites →https://doi.org/10.1016/0012-365x(84)90026-8openalex-snapshot
Once more on matrogenic graphs
inferredcites →https://doi.org/10.1016/0012-365x(87)90184-1openalex-snapshot
On forcibly hereditary p-graphical sequences
inferredcites →https://doi.org/10.1016/0012-365x(90)90284-oopenalex-snapshot
Characterization of forcibly k-variegated degree sequences, k⩾3
inferredcites →https://doi.org/10.1016/0024-3795(80)90105-6openalex-snapshot
Matrices of zeros and ones with fixed row and column sum vectors
inferredcites →https://doi.org/10.1016/0095-8956(72)90055-xopenalex-snapshot
On factorable degree sequences
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(75)90072-6openalex-snapshot
Graphic sequences with unique realization
inferredcites →https://doi.org/10.1016/0095-8956(78)90016-3openalex-snapshot
Construction of hamiltonian graphs and bigraphs with prescribed degrees
inferredcites →https://doi.org/10.1016/0095-8956(83)90052-7openalex-snapshot
A generalization of the Bondy-Chvátal theorem on the k-closure
inferredcites →https://doi.org/10.1016/0095-8956(84)90050-9openalex-snapshot
Distance degree regular graphs
inferredcites →https://doi.org/10.1016/0097-3165(80)90008-4openalex-snapshot
Properties of (0, 1)-matrices with no triangles
inferredcites →https://doi.org/10.1016/0166-218x(83)90041-0openalex-snapshot
Extremal f-trees and embedding spaces for molecular graphs
inferredcites →https://doi.org/10.1016/s0012-365x(74)80016-6openalex-snapshot
Conditions for sequences to be r-graphic
inferredcites →https://doi.org/10.1016/s0095-8956(76)80006-8openalex-snapshot
Pairs of sequences with a unique realization by bipartite graphs
inferredcites →https://doi.org/10.1016/s0095-8956(76)80007-xopenalex-snapshot
Sequences with a unique realization by simple graphs
inferredcites →https://doi.org/10.1016/s0167-5060(08)70319-4openalex-snapshot
Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations
inferredcites →https://doi.org/10.1016/s0167-5060(08)70731-3openalex-snapshot
Aggregation of Inequalities in Integer Programming
inferredcites →https://doi.org/10.1016/s0167-5060(08)70737-4openalex-snapshot
Graphs with Cycles Containing Given Paths
inferredcites →https://doi.org/10.1017/s1446788700023077openalex-snapshot
Almost all chordal graphs split
inferredcites →https://doi.org/10.1080/0025570x.1981.11976936openalex-snapshot
Making Connections: A Graphical Construction
inferredcites →https://doi.org/10.1090/s0002-9939-1975-0384610-1openalex-snapshot
Degree Sequences in Complexes and Hypergraphs
inferredcites →https://doi.org/10.1109/tcs.1976.1084170openalex-snapshot
Line removal algorithms for graphs and their degree lists
inferredcites →https://doi.org/10.1111/j.1749-6632.1979.tb17765.xopenalex-snapshot
ON REGULAR LINE GRAPHS
inferredcites →https://doi.org/10.1111/j.1749-6632.1979.tb32774.xopenalex-snapshot
DEGREES AND CYCLES IN GRAPHS
inferredcites →https://doi.org/10.1111/j.1749-6632.1979.tb32806.xopenalex-snapshot
DEGREE SETS FOR TRIANGLE‐FREE GRAPHS
inferredcites →https://doi.org/10.1137/0114065openalex-snapshot
A Graph-Theoretic Approach to a Communications Problem
inferredcites →https://doi.org/10.1137/0134052openalex-snapshot
A Generalization of Line Connectivity and Optimally Invulnerable Graphs
inferredcites →https://doi.org/10.1137/0206008openalex-snapshot
A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
inferredcites →https://doi.org/10.1137/0603011openalex-snapshot
Switchings Constrained to 2-Connectivity in Simple Graphs
inferredcites →https://doi.org/10.21136/cpm.1955.108220openalex-snapshot
A remark on the existence of finite graphs
inferredcites →https://doi.org/10.21136/cpm.1981.118081openalex-snapshot
Sufficient conditions for edge-locally connected and $n$-connected graphs
inferredcites →https://doi.org/10.21136/cpm.1982.118129openalex-snapshot
On some regularities of graphs. I.
inferredcites →https://doi.org/10.21136/cpm.1984.118207openalex-snapshot
On some regularities of graphs. II.
inferredcites →https://doi.org/10.2140/pjm.1957.7.1073openalex-snapshot
A theorem on flows in networks
inferredcites →https://doi.org/10.4064/cm-45-1-155-158openalex-snapshot
Degree sets for homogeneously traceable non-Hamiltonian graphs
inferredcites →https://doi.org/10.4064/cm-48-2-269-277openalex-snapshot
Degree sets and graph factorizations
inferredcites →https://doi.org/10.4153/cjm-1957-044-3openalex-snapshot
Combinatorial Properties of Matrices of Zeros and Ones
inferredcites →https://doi.org/10.4153/cmb-1980-003-5openalex-snapshot
A Note on Degree Sequences of Graphs
inferredcites →https://doi.org/10.6028/jres.087.010openalex-snapshot
Minimum-Loop Realization of Degree Sequences
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_189openalex-snapshot
Realizing degree sequences in parallel
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_119openalex-snapshot
An O(n) algorithm for realizing degree sequences
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_1openalex-snapshot
Relaxed and Approximate Graph Realizations
inferred← citeshttps://doi.org/10.1007/978-3-030-96731-4_26openalex-snapshot
Vertex-Weighted Graphs: Realizable and Unrealizable Domains
inferred← citeshttps://doi.org/10.1007/978-3-030-97240-0_10openalex-snapshot
Constructing Provably Robust Scale-Free Networks
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/s10114-018-8086-6openalex-snapshot
Extremal Problems on Components and Loops in Graphs
inferred← citeshttps://doi.org/10.1007/s13398-020-00821-7openalex-snapshot
Independence number of graphs and line graphs of trees by means of omega invariant
inferred← citeshttps://doi.org/10.1016/j.dam.2025.11.039openalex-snapshot
On self-duality and unigraphicity for 3-polytopes
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113483openalex-snapshot
Graph realizations: Maximum degree in vertex neighborhoods
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.04.002openalex-snapshot
On degree sequences of undirected, directed, and bidirected graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.012openalex-snapshot
On vertex-weighted realizations of acyclic and general graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115574openalex-snapshot
On the role of the equal partition in degree realization by a bipartite graph
inferred← citeshttps://doi.org/10.1080/16583655.2018.1474542openalex-snapshot
Narumi–Katayama index of the subdivision graphs
inferred← citeshttps://doi.org/10.1137/23m1547585openalex-snapshot
On Bipartite Graph Realizations of a Single Degree Sequence
inferred← citeshttps://doi.org/10.1137/s0895480194267932openalex-snapshot
Realizing Degree Sequences in Parallel
inferred← citeshttps://doi.org/10.1155/2021/3697430openalex-snapshot
Certain Bounds of Regularity of Elimination Ideals on Operations of Graphs
inferred← citeshttps://doi.org/10.21608/ejmaa.2019.312738openalex-snapshot
DEGREE SEQUENCES OF JOIN AND CORONA PRODUCTS OF GRAPHS VISHNU NARAYAN MISHRA1 , SADIK DELEN AND ISMAIL NACI CANGUL
inferred← citeshttps://doi.org/10.2478/amns.2020.2.00018openalex-snapshot
Degree Sequence of Graph Operator for some Standard Graphs
inferred← citeshttps://doi.org/10.28924/2291-8639-16-2018-809openalex-snapshot
Algebraic Structure of Graph Operations in Terms of Degree Sequences
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.