On the public citation graph

A survey of the theory of potentially P-graphic and forcibly P-graphic degree sequences

https://doi.org/10.1007/bfb0092288
0 signed · 203 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.3190020205openalex-snapshot
A class of Hamiltonian regular graphs
inferredcites →https://doi.org/10.1002/jgt.3190020210openalex-snapshot
Graph Decompositions Satisfying Extremal Degree Constraints
inferredcites →https://doi.org/10.1002/jgt.3190020307openalex-snapshot
Degree frequencies in digraphs and tournaments
inferredcites →https://doi.org/10.1002/jgt.3190020412openalex-snapshot
Hamilton cycles in regular graphs
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-0-8176-4842-8_13openalex-snapshot
The Factors of Graphs
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_17openalex-snapshot
A Theorem on Flows in Networks
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_18openalex-snapshot
Combinatorial Properties of Matrices of Zeros and Ones
inferredcites →https://doi.org/10.1007/bf02017925openalex-snapshot
Eccentric sequences in graphs
inferredcites →https://doi.org/10.1007/bf02020548openalex-snapshot
Valencies of graphs with 1-factors
inferredcites →https://doi.org/10.1007/bf02024498openalex-snapshot
On maximal paths and circuits of graphs
inferredcites →https://doi.org/10.1007/bf02194650openalex-snapshot
A note on a problem of hua
inferredcites →https://doi.org/10.1007/bf02280296openalex-snapshot
On decomposition of graphs
inferredcites →https://doi.org/10.1007/bf02476378openalex-snapshot
On dominance relations and the structure of animal societies: III The condition for a score structure
inferredcites →https://doi.org/10.1007/bf02757078openalex-snapshot
Realization of a sum of sequences by a sum graph
inferredcites →https://doi.org/10.1007/bf02759704openalex-snapshot
On Hamiltonian bipartite graphs
inferredcites →https://doi.org/10.1007/bfb0059424openalex-snapshot
The frequency partition of a graph
inferredcites →https://doi.org/10.1007/bfb0059437openalex-snapshot
On the lengths of cycles in planar graphs
inferredcites →https://doi.org/10.1007/bfb0059438openalex-snapshot
Hamiltonian arcs and circuits
inferredcites →https://doi.org/10.1007/bfb0070380openalex-snapshot
Graphs and their degree sequences: A survey
inferredcites →https://doi.org/10.1007/bfb0092259openalex-snapshot
Characterization of potentially connected integer-pair sequences
inferredcites →https://doi.org/10.1007/bfb0092265openalex-snapshot
Characterization of potentially self-complementary, self-converse degree-pair sequences for digraphs
inferredcites →https://doi.org/10.1007/bfb0092289openalex-snapshot
Towards a theory of forcibly hereditary P-graphic sequences
inferredcites →https://doi.org/10.1007/bfb0102683openalex-snapshot
The graph of type (0, ∞, ∞) realizations of a graphic sequence
inferredcites →https://doi.org/10.1016/0012-365x(71)90019-7openalex-snapshot
Large cycles in graphs
inferredcites →https://doi.org/10.1016/0012-365x(72)90079-9openalex-snapshot
A note on Hamiltonian circuits
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(73)90138-6openalex-snapshot
Tough graphs and hamiltonian circuits
inferredcites →https://doi.org/10.1016/0012-365x(74)90075-2openalex-snapshot
Spanning subgraphs with specified valencies
inferredcites →https://doi.org/10.1016/0012-365x(74)90108-3openalex-snapshot
A factorization theorem for a certain class of graphs
inferredcites →https://doi.org/10.1016/0012-365x(74)90137-xopenalex-snapshot
Hamiltonian arcs in self-complementary graphs
inferredcites →https://doi.org/10.1016/0012-365x(74)90147-2openalex-snapshot
Generalizations of the k-factor theorem
inferredcites →https://doi.org/10.1016/0012-365x(76)90029-7openalex-snapshot
Graphs with degrees from prescribed intervals
inferredcites →https://doi.org/10.1016/0012-365x(76)90038-8openalex-snapshot
Simple directed trees
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)90059-5openalex-snapshot
On n-hamiltonian graphs
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(76)90098-4openalex-snapshot
Eccentric sequences and eccentric sets in graphs
inferredcites →https://doi.org/10.1016/0012-365x(76)90107-2openalex-snapshot
Sur les arborescences dans un graphe oriente
inferredcites →https://doi.org/10.1016/0012-365x(77)90034-6openalex-snapshot
A short proof of Meyniel's theorem
inferredcites →https://doi.org/10.1016/0012-365x(77)90049-8openalex-snapshot
Frequency partitions: forcibly pancyclic and forcibly nonhamiltonian degree sequences
inferredcites →https://doi.org/10.1016/0012-365x(77)90073-5openalex-snapshot
Some 4-valent, 3-connected, planar, almost pancyclic graphs
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)90122-4openalex-snapshot
An ore-type condition implying a digraph to be pancyclic
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)90124-3openalex-snapshot
A remark on two sufficient conditions for hamilton cycles
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(79)90139-0openalex-snapshot
On graphs with equal edge connectivity and minimum degree
inferredcites →https://doi.org/10.1016/0016-0032(65)90340-6openalex-snapshot
On the degrees of the vertices of a directed graph
inferredcites →https://doi.org/10.1016/0016-0032(66)90301-2openalex-snapshot
On the realization of a (p,s)-digraph with prescribed degrees
inferredcites →https://doi.org/10.1016/0016-0032(70)90273-5openalex-snapshot
Degree realization of undirected graphs in reduced form
inferredcites →https://doi.org/10.1016/0016-0032(71)90012-3openalex-snapshot
On d-invariant transformations of (p,s)-diagraphs
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(71)90047-5openalex-snapshot
On the number of hexagons in a map
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)90037-3openalex-snapshot
Extreme degree sequences of simple graphs
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)90042-2openalex-snapshot
Frequency sequences in graphs
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(74)90086-0openalex-snapshot
The diameter and radius of simple graphs
inferredcites →https://doi.org/10.1016/0095-8956(75)90045-3openalex-snapshot
On maximal circuits in directed graphs
inferredcites →https://doi.org/10.1016/0095-8956(75)90062-3openalex-snapshot
A note on applying a theorem of tutte to graphical sequences
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(76)90030-7openalex-snapshot
Hamiltonian paths in oriented graphs
inferredcites →https://doi.org/10.1016/0095-8956(76)90063-0openalex-snapshot
On pancyclic digraphs
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/0095-8956(76)90069-1openalex-snapshot
Potentially self-complementary degree sequences
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(78)90037-0openalex-snapshot
A sufficient condition for hamiltonian circuits
inferredcites →https://doi.org/10.1016/0095-8956(79)90009-1openalex-snapshot
Vertex degrees of planar graphs
inferredcites →https://doi.org/10.1016/0095-8956(79)90045-5openalex-snapshot
Score vectors of tournaments
inferredcites →https://doi.org/10.1016/0095-8956(79)90065-0openalex-snapshot
Solution of the Hamiltonian problem for self-complementary graphs
inferredcites →https://doi.org/10.1016/0095-8956(80)90072-6openalex-snapshot
On regular graphs and Hamiltonian circuits, including answers to some questions of Joseph Zaks
inferredcites →https://doi.org/10.1016/0097-3165(78)90059-6openalex-snapshot
The asymptotic number of labeled graphs with given degree sequences
inferredcites →https://doi.org/10.1016/1385-7258(78)90034-3openalex-snapshot
On the existence of subgraphs with degree constraints
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/s0012-365x(74)80020-8openalex-snapshot
An existence theorem for simple convex polyhedra
inferredcites →https://doi.org/10.1016/s0021-9800(69)80043-8openalex-snapshot
A note on K-path hamiltonian graphs
inferredcites →https://doi.org/10.1016/s0021-9800(70)80033-3openalex-snapshot
Subgraphs with prescribed valencies
inferredcites →https://doi.org/10.1016/s0021-9800(70)80037-0openalex-snapshot
A sufficient condition for hamiltonian connectedness
inferredcites →https://doi.org/10.1016/s0021-9800(70)80069-2openalex-snapshot
n-Hamiltonian graphs
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)70496-5openalex-snapshot
Hamiltonian Cycles in Regular Graphs
inferredcites →https://doi.org/10.1016/s0167-5060(08)70503-xopenalex-snapshot
On Maximal Circuits in Finite Graphs
inferredcites →https://doi.org/10.1016/s0167-5060(08)70514-4openalex-snapshot
The Subgraph Problem
inferredcites →https://doi.org/10.1016/s0167-5060(08)70737-4openalex-snapshot
Graphs with Cycles Containing Given Paths
inferredcites →https://doi.org/10.1016/s0924-6509(09)x7013-3openalex-snapshot
Graphs and Hypergraphs
inferredcites →https://doi.org/10.1057/jors.1973.27openalex-snapshot
Applied Graph Theory
inferredcites →https://doi.org/10.1080/00029890.1966.11970749openalex-snapshot
The Theory of Round Robin Tournaments
inferredcites →https://doi.org/10.1090/memo/0099openalex-snapshot
Properties of planar graphs with uniform vertex and face structure.
inferredcites →https://doi.org/10.1090/s0002-9904-1960-10494-6openalex-snapshot
Matrices of zeros and ones
inferredcites →https://doi.org/10.1090/s0002-9939-1953-0063009-7openalex-snapshot
The 1-Factors of Oriented Graphs
inferredcites →https://doi.org/10.1090/s0002-9939-1966-0188103-0openalex-snapshot
On Hamiltonian Circuits in Finite Graphs
inferredcites →https://doi.org/10.1090/s0002-9939-1975-0384610-1openalex-snapshot
Degree Sequences in Complexes and Hypergraphs
inferredcites →https://doi.org/10.1090/s0002-9947-1957-0083725-9openalex-snapshot
Graphs and Subgraphs
inferredcites →https://doi.org/10.1109/tct.1973.1083683openalex-snapshot
On equivalence of realizability conditions of a degree sequence
inferredcites →https://doi.org/10.1111/j.1749-6632.1979.tb32774.xopenalex-snapshot
DEGREES AND CYCLES IN GRAPHS
inferredcites →https://doi.org/10.1112/jlms/s1-22.2.107openalex-snapshot
The Factorization of Linear Graphs
inferredcites →https://doi.org/10.1112/jlms/s1-40.1.87openalex-snapshot
Local Restrictions for Various Classes of Directed Graphs
inferredcites →https://doi.org/10.1112/jlms/s2-19.1.13openalex-snapshot
Edge-Disjoint Hamilton Cycles in Regular Graphs of Large Degree
inferredcites →https://doi.org/10.1112/plms/s3-2.1.69openalex-snapshot
Some Theorems on Abstract Graphs
inferredcites →https://doi.org/10.1112/plms/s3-24.4.739openalex-snapshot
Sufficient Conditions for Circuits in Graphs†
inferredcites →https://doi.org/10.1112/plms/s3-25.3.385openalex-snapshot
On the Toroidal Analogue of Eberhard's Theorem
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/0112070openalex-snapshot
Note on a Problem by S. L. Hakimi Concerning Planar Graphs Without Parallel Elements
inferredcites →https://doi.org/10.1137/0115036openalex-snapshot
On Determining Minimal Singularities for the Realizations of an Incidence Sequence
inferredcites →https://doi.org/10.1137/0118005openalex-snapshot
Minimal Number of Multiple Edges in Realization of an Incidence Sequence Without Loops
inferredcites →https://doi.org/10.1137/0118019openalex-snapshot
On Determining the Minimum Number of Multiple Edges for an Incidence Sequence
inferredcites →https://doi.org/10.1137/0126006openalex-snapshot
Disjoint Representation of Tree Realizable Sequences
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/0130057openalex-snapshot
Edge Disjoint Realizations of Two Forest-Realizable Sequences
inferredcites →https://doi.org/10.1137/0132048openalex-snapshot
On Planar Graphical Degree Sequences
inferredcites →https://doi.org/10.1137/0132050openalex-snapshot
On the Existence of Simultaneous Edge Disjoint Realizations of Degree Sequences with “Few” Edges
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.1957.7.1073openalex-snapshot
A theorem on flows in networks
inferredcites →https://doi.org/10.2140/pjm.1960.10.831openalex-snapshot
Zero-one matrices with zero trace
inferredcites →https://doi.org/10.2140/pjm.1963.13.1343openalex-snapshot
An extension of Landau’s theorem on tournaments
inferredcites →https://doi.org/10.2140/pjm.1970.33.203openalex-snapshot
Existence of triconnected graphs with prescribed degrees
inferredcites →https://doi.org/10.2140/pjm.1975.56.143openalex-snapshot
Simple separable graphs
inferredcites →https://doi.org/10.2307/1969952openalex-snapshot
Studies on Directed Graphs II
inferredcites →https://doi.org/10.2307/1970010openalex-snapshot
Studies on Directed Graphs, I
inferredcites →https://doi.org/10.2307/2308928openalex-snapshot
Note on Hamilton Circuits
inferredcites →https://doi.org/10.2307/2315103openalex-snapshot
Directed Graph Realization of Degree Pairs
inferredcites →https://doi.org/10.2307/2315277openalex-snapshot
No Graph is Perfect
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.4064/fm-95-3-189-194openalex-snapshot
Degree sets for graphs
inferredcites →https://doi.org/10.4153/cjm-1952-028-2openalex-snapshot
The Factors of Graphs
inferredcites →https://doi.org/10.4153/cjm-1954-033-3openalex-snapshot
A Short Proof of the Factor Theorem for Finite Graphs
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/cjm-1963-071-3openalex-snapshot
The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
inferredcites →https://doi.org/10.4153/cjm-1965-016-2openalex-snapshot
Some Properties of Graphs with Multiple Edges
inferredcites →https://doi.org/10.4153/cjm-1966-085-5openalex-snapshot
Enumeration of Locally Restricted Digraphs
inferredcites →https://doi.org/10.4153/cjm-1968-005-0openalex-snapshot
Enumeration of Graphs with Given Partition
inferredcites →https://doi.org/10.4153/cmb-1964-015-1openalex-snapshot
Computation of the Number of Score Sequences in Round-Robin Tournaments
inferredcites →https://doi.org/10.4153/cmb-1966-016-xopenalex-snapshot
On Sums of Valencies in Planar Graphs
inferredcites →https://doi.org/10.4153/cmb-1969-004-1openalex-snapshot
On Polyhedral Realizability of Certain Sequences
inferredcites →https://doi.org/10.4153/cmb-1972-012-3openalex-snapshot
Variations on the Hamiltonian Theme
inferredcites →https://doi.org/10.4153/cmb-1974-116-6openalex-snapshot
Sequences Realizable by Graphs with Hamiltonian Squares
inferredcites →https://doi.org/10.4153/cmb-1979-004-6openalex-snapshot
Self-Converse Tournaments
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.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.20270openalex-snapshot
Graph classes characterized both by forbidden subgraphs and degree sequences
inferred← citeshttps://doi.org/10.1002/jgt.20652openalex-snapshot
Graphic Sequences Have Realizations Containing Bisections of Large Degree
inferred← citeshttps://doi.org/10.1002/jgt.70081openalex-snapshot
Sparse Graphic Degree Sequences Have Planar Realizations
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_5openalex-snapshot
Composed Degree-Distance Realizations of Graphs
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-031-32733-9_1openalex-snapshot
Degree Realization by Bipartite Multigraphs
inferred← citeshttps://doi.org/10.1007/978-3-031-55601-2_1openalex-snapshot
Self-complementary (Pseudo-)Split Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-63021-7_8openalex-snapshot
Approximate Realizations for Outerplanaric Degree Sequences
inferred← citeshttps://doi.org/10.1007/978-3-031-92932-8_17openalex-snapshot
Degree Realization by Bipartite Cactus Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-92932-8_21openalex-snapshot
Realizing Graphs with Cut Constraints
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/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/bf01157039openalex-snapshot
Potentially 2-connected integerpair sequences
inferred← citeshttps://doi.org/10.1007/bf02879940openalex-snapshot
The Erdös-Jacobson-Lehel conjecture on potentiallyP k-graphic sequence is true
inferred← citeshttps://doi.org/10.1007/bfb0073116openalex-snapshot
Equalities involving certain graphical distributions
inferred← citeshttps://doi.org/10.1007/bfb0092289openalex-snapshot
Towards a theory of forcibly hereditary P-graphic sequences
inferred← citeshttps://doi.org/10.1007/s00373-007-0737-9openalex-snapshot
Graphic Sequences with a Realization Containing a Union of Cliques
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/s00373-018-1953-1openalex-snapshot
Adjacency Relationships Forced by a Degree Sequence
inferred← citeshttps://doi.org/10.1007/s00453-022-01055-2openalex-snapshot
Composed Degree-Distance Realizations of Graphs
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.1007/s10255-016-0622-5openalex-snapshot
Graphic sequences and split graphs
inferred← citeshttps://doi.org/10.1007/s10255-019-0813-yopenalex-snapshot
On a Problem of Potentially Pancyclic-graphic Sequences Due to S.B. Rao
inferred← citeshttps://doi.org/10.1016/0012-365x(83)90175-9openalex-snapshot
Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90184-1openalex-snapshot
On forcibly hereditary p-graphical sequences
inferred← citeshttps://doi.org/10.1016/0095-8956(87)90050-5openalex-snapshot
Score vectors of Kotzig tournaments
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90092-qopenalex-snapshot
Difference graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.01.040openalex-snapshot
Largest domination number and smallest independence number of forests with given degree sequence
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/csci54926.2021.00035openalex-snapshot
An Experimental Evaluation of a Function in Extremal Combinatorics
inferred← citeshttps://doi.org/10.1109/wsc.2011.6148031openalex-snapshot
Directed 3-cycle anchored digraphs and their application in the uniform sampling of realizations from a fixed 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.1137/23m1547585openalex-snapshot
On Bipartite Graph Realizations of a Single Degree Sequence
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.20429/tag.2018.050202openalex-snapshot
An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences
inferred← citeshttps://doi.org/10.20429/tag.2019.060204openalex-snapshot
Forcibly-biconnected Graphical Degree Sequences: Decision Algorithms and Enumerative Results
inferred← citeshttps://doi.org/10.20429/tag.2021.080103openalex-snapshot
An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences
inferred← citeshttps://doi.org/10.3390/math12223518openalex-snapshot
New Results on Graph Matching from Degree-Preserving Growth
inferred← citeshttps://doi.org/10.3390/math14101671openalex-snapshot
Characterizations for Degree Sequence Pairs Being Realizable by Graphs
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.1507.04650openalex-snapshot
Largest Domination Number and Smallest Independence Number of Forests with given Degree Sequence
inferred← citeshttps://doi.org/10.48550/arxiv.1705.00186openalex-snapshot
Cyclic Hypergraph Degree Sequences
inferred← citeshttps://doi.org/10.48550/arxiv.1803.00673openalex-snapshot
An efficient algorithm to test forcibly-connectedness of graphical degree sequences
inferred← citeshttps://doi.org/10.48550/arxiv.1908.06821openalex-snapshot
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences
inferred← citeshttps://doi.org/10.48550/arxiv.2103.02283openalex-snapshot
Pseudoline arrangement graphs: degree sequences and eccentricities
inferred← citeshttps://doi.org/10.5555/2431518.2431916openalex-snapshot
Directed 3-cycle anchored digraphs and their application in the uniform sampling of realizations from a fixed degree sequence
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.