Pages that link to "Item:Q3978365"
From MaRDI portal
The following pages link to Seven criteria for integer sequences being graphic (Q3978365):
Displaying 41 items.
- Improving the characterization of P-stability for applications in network privacy (Q277631) (← links)
- Colour degree matrices of graphs with at most one cycle (Q298973) (← links)
- New results on degree sequences of uniform hypergraphs (Q396927) (← links)
- When the degree sequence is a sufficient statistic (Q663053) (← links)
- Generation of networks with prescribed degree-dependent clustering (Q691437) (← links)
- New sufficient conditions on the degree sequences of uniform hypergraphs (Q831139) (← links)
- A short constructive proof of the Erdős-Gallai characterization of graphic lists (Q965964) (← links)
- A simple criterion on degree sequences of graphs (Q1003744) (← links)
- Relations on generalized degree sequences (Q1043962) (← links)
- The convex hull of degree sequences of signed graphs (Q1045125) (← links)
- Degree maximal graphs are Laplacian integral (Q1322880) (← links)
- Efficient generation of graphical partitions (Q1377650) (← links)
- Asymptotic joint distribution of the extremities of a random Young diagram and enumeration of graphical partitions (Q1644966) (← links)
- How likely is an LLD degree sequence to be graphical? (Q1774191) (← links)
- Confirming two conjectures about the integer partitions (Q1806217) (← links)
- Split graphs (Q1873776) (← links)
- Synchronizability of networks of chaotic systems coupled via a graph with a prescribed degree sequence (Q1957375) (← links)
- The Zipf-Poisson-stopped-sum distribution with an application for modeling the degree sequence of social networks (Q2008132) (← links)
- A generalization of a theorem of Nash-Williams (Q2102754) (← links)
- Note on a zero net-regular signed graph (Q2112648) (← links)
- Relaxed and approximate graph realizations (Q2115836) (← links)
- Vertex-weighted graphs: realizable and unrealizable domains (Q2154111) (← links)
- Independence number of graphs and line graphs of trees by means of omega invariant (Q2174305) (← links)
- An up-to-date review of scan statistics (Q2233594) (← links)
- Vertex-weighted realizations of graphs (Q2286737) (← links)
- On maximal graphical partitions that are the nearest to a given graphical partition (Q2306054) (← links)
- Graphs with prescribed local neighborhoods of their universal coverings (Q2312618) (← links)
- The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence (Q2365681) (← links)
- A remark concerning graphical sequences (Q2576835) (← links)
- On vertex-weighted realizations of acyclic and general graphs (Q2672574) (← links)
- On vertex-weighted graph realizations (Q2692719) (← links)
- The sharpness of a lower bound on the algebraic connectivity for maximal graphs (Q2720366) (← links)
- P-antiregular graphs (Q3439306) (← links)
- A survey of graph laplacians (Q4853923) (← links)
- Resolution of Yan's Conjecture on Entropy of Graphs (Q5050774) (← links)
- Lorentz and Gale–Ryser theorems on general measure spaces (Q5094459) (← links)
- On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition (Q5237060) (← links)
- Algebraic characterization of graphical degree stability (Q5240531) (← links)
- (Q5874474) (← links)
- AROUND THE ERDÖS–GALLAI CRITERION (Q6081693) (← links)
- Graph realizations: maximum degree in vertex neighborhoods (Q6098074) (← links)
