2006.bib

2006e
A 3-approximation for the pathwidth of {H}alin graphs
F. V. Fomin and D. M. Thilikos
J. Discrete Algorithms  4  499--510  (2006)

2006d
Dominating sets in planar graphs: branch-width and exponential speed-up
F. V. Fomin and D. M. Thilikos
SIAM J. Comput.  36  281--309 (electronic)  (2006)

2006c
Planar graph coloring avoiding monochromatic subgraphs: trees and paths make it difficult
H. Broersma and F. V. Fomin and J. Kratochv\il and G. J. Woeginger
Algorithmica  44  343--361  (2006)

2006b
Pathwidth of cubic graphs and exact algorithms
F. V. Fomin and K. Høie
Inform. Process. Lett.  97  191--196  (2006)

2006a
New upper bounds on the decomposability of planar graphs
F. V. Fomin and D. M. Thilikos
J. Graph Theory  51  53--81  (2006)