Recommendations
- Triangle edge deletion on planar glasses-free RGB-digraphs
- On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
- Triangle-free planar graphs with small independence number
- On Polynomial Kernelization of $$\mathcal {H}$$-free Edge Deletion
- Two edge modification problems without polynomial kernels
Cites work
- A Problem Kernelization for Graph Packing
- Approximating Maximum Subgraphs without Short Cycles
- Automated generation of search tree algorithms for hard graphs modification problems
- Edge-Deletion Problems
- Finding and counting given length cycles
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Kernelization Algorithms for d-Hitting Set Problems
Cited in
(24)- Two edge modification problems without polynomial kernels
- On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion}
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
- Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal
- A balm: defend the clique-based attack from a fundamental aspect
- The parameterized complexity and kernelization of resilience for database queries
- New kernels for several problems on planar graphs
- Triangle edge deletion on planar glasses-free RGB-digraphs
- Polynomial kernelization for removing induced claws and diamonds
- Kernel for \(K_t\)\textsc-free Edge Deletion
- On the small cycle transversal of planar graphs
- Testing Triangle-Freeness in General Graphs
- Two edge modification problems without polynomial kernels
- Kernelization for cycle transversal problems
- scientific article; zbMATH DE number 1124474 (Why is no real title available?)
- Generating weakly triangulated graphs
- On the small cycle transversal of planar graphs
- Feedback edge sets in temporal graphs
- A survey of parameterized algorithms and the complexity of edge modification
- Cutting a tree with subgraph complementation is hard, except for some small trees
- Kernelization for edge triangle packing and covering via a discharging method
- A discharging method: improved kernels for edge triangle packing and covering
- Cutting a tree with subgraph complementation is hard, except for some small trees
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique
This page was built for publication: On generating triangle-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2839211)
