New upper bounds on the decomposability of planar graphs

DOI10.1002/jgt.20121zbMath1085.05049WikidataQ56679466 ScholiaQ56679466MaRDI QIDQ3376690

Fedor V. Fomin, Dimitrios M. Thilikos

Publication date: 24 March 2006

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20121

zbMATH Keywords

parameterized algorithms; tree-width; separation theorems; branch-width; subexponential algorithms

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C10: Planar graphs; geometric and topological aspects of graph theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)