Seven criteria for integer sequences being graphic
From MaRDI portal
Publication:3978365
DOI10.1002/jgt.3190150209zbMath0752.05052OpenAlexW2099254026WikidataQ56502777 ScholiaQ56502777MaRDI QIDQ3978365
Hoogeveen, J. A., Gerard Sierksma
Publication date: 25 June 1992
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/1579
Related Items (42)
Split graphs ⋮ Improving the characterization of P-stability for applications in network privacy ⋮ The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence ⋮ New sufficient conditions on the degree sequences of uniform hypergraphs ⋮ Colour degree matrices of graphs with at most one cycle ⋮ Resolution of Yan's Conjecture on Entropy of Graphs ⋮ Asymptotic joint distribution of the extremities of a random Young diagram and enumeration of graphical partitions ⋮ Vertex-weighted graphs: realizable and unrealizable domains ⋮ Efficient generation of graphical partitions ⋮ Independence number of graphs and line graphs of trees by means of omega invariant ⋮ Lorentz and Gale–Ryser theorems on general measure spaces ⋮ On vertex-weighted realizations of acyclic and general graphs ⋮ New results on degree sequences of uniform hypergraphs ⋮ A survey of graph laplacians ⋮ AROUND THE ERDÖS–GALLAI CRITERION ⋮ Graph realizations: maximum degree in vertex neighborhoods ⋮ Unnamed Item ⋮ On vertex-weighted graph realizations ⋮ Synchronizability of networks of chaotic systems coupled via a graph with a prescribed degree sequence ⋮ Algebraic characterization of graphical degree stability ⋮ Unnamed Item ⋮ The sharpness of a lower bound on the algebraic connectivity for maximal graphs ⋮ When the degree sequence is a sufficient statistic ⋮ An up-to-date review of scan statistics ⋮ Generation of networks with prescribed degree-dependent clustering ⋮ A short constructive proof of the Erdős-Gallai characterization of graphic lists ⋮ The Zipf-Poisson-stopped-sum distribution with an application for modeling the degree sequence of social networks ⋮ How likely is an LLD degree sequence to be graphical? ⋮ Vertex-weighted realizations of graphs ⋮ A simple criterion on degree sequences of graphs ⋮ Confirming two conjectures about the integer partitions ⋮ On maximal graphical partitions that are the nearest to a given graphical partition ⋮ Graphs with prescribed local neighborhoods of their universal coverings ⋮ On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition ⋮ Relations on generalized degree sequences ⋮ The convex hull of degree sequences of signed graphs ⋮ A remark concerning graphical sequences ⋮ A generalization of a theorem of Nash-Williams ⋮ P-antiregular graphs ⋮ Note on a zero net-regular signed graph ⋮ Relaxed and approximate graph realizations ⋮ Degree maximal graphs are Laplacian integral
Cites Work
This page was built for publication: Seven criteria for integer sequences being graphic
