Title of article
Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs
Author/Authors
Hajiaghayi، نويسنده , , Mohammadtaghi and Nishimura، نويسنده , , Naomi and Ragde، نويسنده , , Prabhakar and Thilikos، نويسنده , , Dimitrios M.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
6
From page
137
To page
142
Abstract
We prove that any graph excluding one of K5 or K3, 3 as a minor has local treewidth bounded by 3k + 4. As a result, we can design practical polynomial-time approximation schemes for both minimization and maximization problems on these classes of non-planar graphs.
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2001
Journal title
Electronic Notes in Discrete Mathematics
Record number
1452935
Link To Document