Pages that link to "Item:Q1905161"
From MaRDI portal
The following pages link to Computing the isoperimetric number of a graph (Q1905161):
Displaying 5 items.
- On the complexity of isoperimetric problems on trees (Q765346) (← links)
- On the isoperimetric spectrum of graphs and its approximations (Q974467) (← links)
- Maximum rooted connected expansion (Q2034397) (← links)
- Lit-only sigma game on a line graph (Q2519798) (← links)
- Isoperimetric numbers and bisection widths of double coverings of a complete graph. (Q2715969) (← links)