Pages that link to "Item:Q1006087"
From MaRDI portal
The following pages link to On the complexity of approximating the Hadwiger number (Q1006087):
Displaying 5 items.
- Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) (← links)
- Connected matchings in chordal bipartite graphs (Q2339830) (← links)
- (Q3424894) (← links)
- Approximating permanents and hafnians (Q4645007) (← links)
- Computation of Hadwiger Number and Related Contraction Problems (Q5065632) (← links)