Partitioning graphs into induced subgraphs

DOI10.1007/978-3-319-53733-7_25MaRDI QIDQ6828226zbMATH OpenFDO

Authors Dušan Knop

Publication date 1 June 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

parametrized complexitygeneralized matching

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Partitioning graphs into induced subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6828226)