Stable-\(\Pi\) partitions of graphs

DOI10.1016/j.dam.2013.07.001zbMath1306.05189MaRDI QIDQ2255049

Vadim V. Lozin, Konrad K. Dabrowski, Juraj Stacho

Publication date: 6 February 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.07.001

zbMATH Keywords

NP-completeness; polynomial time; hereditary property; factorial property; speed of graph property; stable-\(\Pi\) partition

Mathematics Subject Classification ID

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

05C75: Structural characterization of families of graphs

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