Pages that link to "Item:Q5586078"
From MaRDI portal
The following pages link to Minimal Number of Multiple Edges in Realization of an Incidence Sequence Without Loops (Q5586078):
Displaying 5 items.
- Multigraph realizations of degree sequences: Maximization is easy, minimization is hard (Q957360) (← links)
- Relaxed and approximate graph realizations (Q2115836) (← links)
- Algorithms for constructing graphs and digraphs with given valences and factors (Q2561241) (← links)
- Construction of a Maximally Edge-Connected Graph with Prescribed Degrees (Q4093476) (← links)
- Some problems in discrete optimization (Q5636690) (← links)
