scientific article; zbMATH DE number 7651149
From MaRDI portal
Publication:5874474
DOI10.4230/LIPICS.ESA.2020.10MaRDI QIDQ5874474FDOQ5874474
Authors: Amotz Bar-Noy, Keerti Choudhary, Avi Cohen, David Peleg, Dror Rawitz 
Publication date: 7 February 2023
Title of this publication is not available (Why is that?)
Cites Work
- Title not available (Why is that?)
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Decomposition of graphical sequences and unigraphs
- A remark on the existence of finite graphs
- Seven criteria for integer sequences being graphic
- Title not available (Why is that?)
- A congruence theorem for trees
- A sequential importance sampling algorithm for generating random graphs with prescribed degrees
- Realizability and uniqueness in graphs
- Title not available (Why is that?)
- Threshold Sequences
- A simple criterion on degree sequences of graphs
- A simple proof of the Erdos-Gallai theorem on graph sequences
- On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)
- Fast Sequential Creation of Random Realizations of Degree Sequences
- Realizability of graph specifications: characterizations and algorithms
- Efficiently Realizing Interval Sequences
- Neighborhood degree lists of graphs
- Vertex-weighted realizations of graphs
- Graph profile realizations and applications to social networks
- Ulam's Conjecture and Graph Reconstructions
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)
