Quickly deciding minor-closed parameters in general graphs

DOI10.1016/j.ejc.2005.07.003zbMath1105.05065OpenAlexW1973646572MaRDI QIDQ854832

Erik D. Demaine, Mohammad Taghi Hajiaghayi

Publication date: 7 December 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2005.07.003

Mathematics Subject Classification ID

Graph minors (05C83)

Related Items (3)

Towards tight(er) bounds for the excluded grid theorem ⋮ Polynomial treewidth forces a large grid-like-minor ⋮ Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• Quickly excluding a planar graph
• Graph minors. XIII: The disjoint paths problem
• Graph minors. XII: Distance on a surface
• Deciding first-order properties of locally tree-decomposable structures
• Nonconstructive tools for proving polynomial-time decidability
• Bidimensional Parameters and Local Treewidth

This page was built for publication: Quickly deciding minor-closed parameters in general graphs