scientific article; zbMATH DE number 7651149
From MaRDI portal
Publication:5874474
Cites work
- scientific article; zbMATH DE number 3141308 (Why is no real title available?)
- scientific article; zbMATH DE number 3166040 (Why is no real title available?)
- scientific article; zbMATH DE number 1342092 (Why is no real title available?)
- A congruence theorem for trees
- A remark on the existence of finite graphs
- A sequential importance sampling algorithm for generating random graphs with prescribed degrees
- A simple criterion on degree sequences of graphs
- A simple proof of the Erdos-Gallai theorem on graph sequences
- Decomposition of graphical sequences and unigraphs
- Efficiently realizing interval sequences
- Fast sequential creation of random realizations of degree sequences
- Graph profile realizations and applications to social networks
- Neighborhood degree lists of graphs
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)
- Realizability and uniqueness in graphs
- Realizability of graph specifications: characterizations and algorithms
- Seven criteria for integer sequences being graphic
- Threshold Sequences
- Ulam's Conjecture and Graph Reconstructions
- Vertex-weighted realizations of graphs
Cited in
(5)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874474)
