Partitioning Graphs into Connected Parts

DOI10.1007/978-3-642-03351-3_15zbMath1248.68393MaRDI QIDQ3392949

Gerhard J. Woeginger, Daniël Paulusma, Pim van 't Hof

Publication date: 18 August 2009

Published in: Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03351-3_15

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

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

05C85: Graph algorithms (graph-theoretic aspects)