On vertex-weighted realizations of acyclic and general graphs
From MaRDI portal
Publication:2672574
DOI10.1016/j.tcs.2022.04.012OpenAlexW4223950360MaRDI QIDQ2672574
Dror Rawitz, David Peleg, Amotz Bar-Noy, Toni Böhnlein
Publication date: 13 June 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.04.012
Related Items (2)
Vertex-weighted graphs: realizable and unrealizable domains ⋮ Degree realization by bipartite multigraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A congruence theorem for trees
- A theorem on flows in networks
- A short constructive proof of the Erdős-Gallai characterization of graphic lists
- A simple criterion on degree sequences of graphs
- The splittance of a graph
- On the equal-subset-sum problem
- Contributions to the theory of graphic sequences
- Realizability and uniqueness in graphs
- Decomposition of graphical sequences and unigraphs
- On forcibly hereditary P-graphical sequences
- A note on a theorem of Erdős and Gallai
- Vertex-weighted realizations of graphs
- A remark concerning graphical sequences
- A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
- Sufficient Conditions for Graphicality of Bidegree Sequences
- A remark on the existence of finite graphs
- Combinatorial Properties of Matrices of Zeros and Ones
- Graphs and degree sequences. II
- Graphic sequences of trees and a problem of Frobenius
- Graphs and degree sequences: Canonical decomposition
- A simple proof of the Erdos-Gallai theorem on graph sequences
- Graphs and degree sequences. I
- 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
- Graphs and degree sequences: A survey. III
- Ulam's Conjecture and Graph Reconstructions
- Fast Sequential Creation of Random Realizations of Degree Sequences
This page was built for publication: On vertex-weighted realizations of acyclic and general graphs
