Pages that link to "Item:Q1022596"
From MaRDI portal
The following pages link to Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596):
Displaying 4 items.
- On the complexity of approximating the Hadwiger number (Q1006087) (← links)
- Connected matchings in chordal bipartite graphs (Q2339830) (← links)
- Hadwiger Number of Graphs with Small Chordality (Q2945190) (← links)
- Efficient Approximation Schemes for Maximization Problems onK3,3-free orK5-free Graphs (Q4377126) (← links)