Maximum regular induced subgraphs in \(2P_3\)-free graphs

DOI10.1016/j.tcs.2012.06.014zbMath1252.68155MaRDI QIDQ690473

Raffaele Mosca, Vadim V. Lozin

Publication date: 27 November 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.014

zbMATH Keywords

independent set; polynomial-time algorithm; clique; induced matching; regular induced subgraph; \(2P_{3}\)-free graphs

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

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

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)