Destroying Bicolored $P_3$s by Deleting Few Edges
We introduce and study the Bicolored $P_3$ Deletion problem defined as follows. The input is a graph $G=(V,E)$ where the edge set $E$ is partitioned into a set $E_r$ of red edges and a set $E_b$ of blue edges. The question is whether we can delete at most $k$ edges such that $G$ does not contain a b...
| Asıl Yazarlar: | , , , |
|---|---|
| Materyal Türü: | Makale |
| Dil: | English |
| Baskı/Yayın Bilgisi: |
Discrete Mathematics & Theoretical Computer Science
2021-06-01
|
| Seri Bilgileri: | Discrete Mathematics & Theoretical Computer Science |
| Konular: | |
| Online Erişim: | https://dmtcs.episciences.org/6108/pdf |