On the complexity of approximating the Hadwiger number

DOI10.1016/J.TCS.2008.12.020zbMath1162.68018OpenAlexW1989192933MaRDI QIDQ1006087

Martin Wahlen

Publication date: 17 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.12.020

zbMATH Keywords

approximationgraph minorsHadwiger number

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph minors (05C83)

Related Items (1)

Connected matchings in chordal bipartite graphs

Cites Work

• Approximating the maximum clique minor and some subgraph homeomorphism problems

This page was built for publication: On the complexity of approximating the Hadwiger number