3 papers
math.CO2026
Degree Realization by Bipartite Multigraphs
Amotz Bar-Noy, Toni Bohnlein, David Peleg +1
The problem of realizing a given degree sequence by a multigraph can be thought of as a relaxation of the classical degree realization problem (where the realizing graph is simple)…
cs.DM2025
Optimized Degree Realization: Minimum Dominating Set & Maximum Matching
Amotz Bar-Noy, Igor Kalinichev, David Peleg +1
The Degree Realization problem requires, given a sequence of positive integers, to decide whether there exists a graph whose degrees correspond to , and to construct suc…
cs.DM2025
Degree Realization by Bipartite Cactus Graphs
Amotz Bar-Noy, Toni Bohnlein, David Peleg +2
The \textsc{Degree Realization} problem with respect to a graph family is defined as follows. The input is a sequence of positive integers, and the goal is to…