Degree realization by bipartite multigraphs

DOI10.1007/978-3-031-32733-9_1MaRDI QIDQ6188142

Toni Böhnlein, Amotz Bar-Noy, Dror Rawitz, David Peleg

Publication date: 11 January 2024

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conditions for sequences to be r-graphic
• A theorem on flows in networks
• Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
• Contributions to the theory of graphic sequences
• A note on a theorem of Erdős and Gallai
• Reduced criteria for degree sequences
• Relaxed and approximate graph realizations
• On vertex-weighted realizations of acyclic and general graphs
• Sufficient Conditions for Graphicality of Bidegree Sequences
• A remark on the existence of finite graphs
• Combinatorial Properties of Matrices of Zeros and Ones
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Parsimonious Multigraphs
• On Determining Minimal Singularities for the Realizations of an Incidence Sequence

This page was built for publication: Degree realization by bipartite multigraphs