Partitioning graphs into induced subgraphs

DOI10.1016/j.dam.2019.01.010zbMath1429.05166arXiv1508.04725MaRDI QIDQ2283104

Dušan Knop

Publication date: 30 December 2019

Published in: Discrete Applied Mathematics, Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.04725

zbMATH Keywords

graph partitioning; graph matching; parameterized complexity; parametrized complexity; dense graphs; generalized matching

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

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)

05C42: Density (toughness, etc.)

68Q27: Parameterized complexity, tractability and kernelization