Pages that link to "Item:Q2839211"
From MaRDI portal
The following pages link to On generating triangle-free graphs (Q2839211):
Displaying 24 items.
- Kernelization for cycle transversal problems (Q423937) (← links)
- On the small cycle transversal of planar graphs (Q551170) (← links)
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique (Q896028) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- Two edge modification problems without polynomial kernels (Q1662097) (← links)
- On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion} (Q1679221) (← links)
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
- Approximation algorithms on \(k\)-cycle transversal and \(k\)-clique transversal (Q2059196) (← links)
- A balm: defend the clique-based attack from a fundamental aspect (Q2082182) (← links)
- The parameterized complexity and kernelization of resilience for database queries (Q2202009) (← links)
- New kernels for several problems on planar graphs (Q2285156) (← links)
- Triangle edge deletion on planar glasses-free RGB-digraphs (Q2317352) (← links)
- Polynomial kernelization for removing induced claws and diamonds (Q2398208) (← links)
- Kernel for \(K_t\)\textsc{-free Edge Deletion} (Q2656346) (← links)
- On the Small Cycle Transversal of Planar Graphs (Q3057617) (← links)
- Testing Triangle-Freeness in General Graphs (Q3629476) (← links)
- Two Edge Modification Problems without Polynomial Kernels (Q3656868) (← links)
- Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete (Q4378523) (← links)
- Generating weakly triangulated graphs (Q4862110) (← links)
- Feedback edge sets in temporal graphs (Q5918410) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- Kernelization for edge triangle packing and covering via a discharging method (Q6558639) (← links)
- A discharging method: improved kernels for edge triangle packing and covering (Q6591629) (← links)
- Cutting a tree with subgraph complementation is hard, except for some small trees (Q6595520) (← links)
