Destroying Bicolored $P_3$s by Deleting Few Edges
From MaRDI portal
Publication:5038193
DOI10.46298/dmtcs.6108zbMath1498.05097OpenAlexW2909443810MaRDI QIDQ5038193
Frank Sommer, Jannik Schestag, Christian Komusiewicz, Niels Grüttemeier
Publication date: 30 September 2022
Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://dmtcs.episciences.org/7553
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (max. 100)
Cites Work
- Fundamentals of parameterized complexity
- Exact exponential algorithms.
- A simplified NP-complete satisfiability problem
- A more effective linear kernelization for cluster editing
- The node-deletion problem for hereditary properties is NP-complete
- Which problems have strongly exponential complexity?
- A note on finding the bridges of a graph
- Cluster graph modification problems
- Even faster parameterized cluster deletion and cluster editing
- Fast Quasi-Threshold Editing
- Edge-Deletion Problems
- Graph Classes: A Survey
- Edge colorings of complete graphs without tricolored triangles
- Tight Running Time Lower Bounds for Vertex Deletion Problems
- Cluster Editing
- Dichotomy Results on the Hardness of $H$-free Edge Modification Problems
- Parameterized Algorithms
- Transitiv orientierbare Graphen
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- On the relation of strong triadic closure and cluster deletion
- Parameterized algorithms for module map problems
This page was built for publication: Destroying Bicolored $P_3$s by Deleting Few Edges
