Seven criteria for integer sequences being graphic
From MaRDI portal
Recommendations
Cites work
Cited in
(54)- A simple criterion on degree sequences of graphs
- Relations on generalized degree sequences
- The convex hull of degree sequences of signed graphs
- Degree maximal graphs are Laplacian integral
- The Erdős-Gallai criterion and symmetric functions
- Efficient generation of graphical partitions
- Asymptotic joint distribution of the extremities of a random Young diagram and enumeration of graphical partitions
- How likely is an LLD degree sequence to be graphical?
- Confirming two conjectures about the integer partitions
- Split graphs
- Synchronizability of networks of chaotic systems coupled via a graph with a prescribed degree sequence
- The Zipf-Poisson-stopped-sum distribution with an application for modeling the degree sequence of social networks
- A generalization of a theorem of Nash-Williams
- Note on a zero net-regular signed graph
- Relaxed and approximate graph realizations
- Vertex-weighted graphs: realizable and unrealizable domains
- Independence number of graphs and line graphs of trees by means of omega invariant
- An up-to-date review of scan statistics
- Vertex-weighted realizations of graphs
- On maximal graphical partitions that are the nearest to a given graphical partition
- Graphs with prescribed local neighborhoods of their universal coverings
- The structure matrix of the class of r-multigraphs with a prescribed degree sequence
- A remark concerning graphical sequences
- On vertex-weighted realizations of acyclic and general graphs
- On vertex-weighted graph realizations
- The sharpness of a lower bound on the algebraic connectivity for maximal graphs
- Improving the characterization of P-stability for applications in network privacy
- An improvement of a result of Zverovich-Zverovich
- Colour degree matrices of graphs with at most one cycle
- P-antiregular graphs
- New results on degree sequences of uniform hypergraphs
- scientific article; zbMATH DE number 54810 (Why is no real title available?)
- Constructive extensions of two results on graphic sequences
- A survey of graph laplacians
- scientific article; zbMATH DE number 819127 (Why is no real title available?)
- Resolution of Yan's conjecture on entropy of graphs
- Lorentz and Gale–Ryser theorems on general measure spaces
- On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition
- Algebraic characterization of graphical degree stability
- Degree sequences in graphs
- scientific article; zbMATH DE number 7651149 (Why is no real title available?)
- AROUND THE ERDÖS–GALLAI CRITERION
- Graph realizations: maximum degree in vertex neighborhoods
- The edge-count criterion for graphic lists
- Convex hulls of Grassmannians and combinatorics of symmetric hypermatrices
- Computational complexity of counting coincidences
- When the degree sequence is a sufficient statistic
- An algebraic approach to the reconstruction of uniform hypergraphs from their degree sequence
- Generation of networks with prescribed degree-dependent clustering
- Counting graphic sequences via integrated random walks
- Randomized algorithms to generate hypergraphs with given degree sequences
- On bipartite graph realizations of a single degree sequence
- New sufficient conditions on the degree sequences of uniform hypergraphs
- A short constructive proof of the Erdős-Gallai characterization of graphic lists
This page was built for publication: Seven criteria for integer sequences being graphic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3978365)
