scientific article; zbMATH DE number 7651149
From MaRDI portal
Publication:5874474
DOI10.4230/LIPIcs.ESA.2020.10MaRDI QIDQ5874474
Amotz Bar-Noy, Avi Cohen, Keerti Choudhary, Dror Rawitz, David Peleg
Publication date: 7 February 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Graph realizations: maximum degree in vertex neighborhoods ⋮ Composed degree-distance realizations of graphs ⋮ Composed degree-distance realizations of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A congruence theorem for trees
- A simple criterion on degree sequences of graphs
- Realizability and uniqueness in graphs
- Decomposition of graphical sequences and unigraphs
- Realizability of graph specifications: characterizations and algorithms
- Vertex-weighted realizations of graphs
- Graph profile realizations and applications to social networks
- Neighborhood degree lists of graphs
- A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
- A remark on the existence of finite graphs
- A simple proof of the Erdos-Gallai theorem on graph sequences
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Threshold Sequences
- Seven criteria for integer sequences being graphic
- Efficiently Realizing Interval Sequences
- Ulam's Conjecture and Graph Reconstructions
- On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)
- Fast Sequential Creation of Random Realizations of Degree Sequences
This page was built for publication:
