Partition into Triangles on Bounded Degree Graphs

DOI10.1007/978-3-642-18381-2_46zbMath1298.68119WikidataQ59567611 ScholiaQ59567611MaRDI QIDQ3075543

Hans L. Bodlaender, Johan M. M. van Rooij, Marcel E. van Kooten Niekerk

Publication date: 15 February 2011

Published in: SOFSEM 2011: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18381-2_46

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

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

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)