Minimal Number of Multiple Edges in Realization of an Incidence Sequence Without Loops
From MaRDI portal
Publication:5586078
DOI10.1137/0118005zbMath0191.55301OpenAlexW2077053569MaRDI QIDQ5586078
Publication date: 1970
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0118005
Related Items (5)
Some problems in discrete optimization ⋮ Construction of a Maximally Edge-Connected Graph with Prescribed Degrees ⋮ Multigraph realizations of degree sequences: Maximization is easy, minimization is hard ⋮ Algorithms for constructing graphs and digraphs with given valences and factors ⋮ Relaxed and approximate graph realizations
This page was built for publication: Minimal Number of Multiple Edges in Realization of an Incidence Sequence Without Loops
