Destroying bicolored \(P_3\)s by deleting few edges

DOI10.1007/978-3-030-22996-2_17zbMath1434.68358arXiv1901.03627OpenAlexW2964147744MaRDI QIDQ2179362

Christian Komusiewicz, Niels Grüttemeier, Jannik Schestag, Frank Sommer

Publication date: 12 May 2020

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Parameterized algorithms for module map problems

This page was built for publication: Destroying bicolored \(P_3\)s by deleting few edges