Pages that link to "Item:Q355502"
From MaRDI portal
The following pages link to Planar graph vertex partition for linear problem kernels (Q355502):
Displayed 14 items.
- A \(13k\)-kernel for planar feedback vertex set via region decomposition (Q306250) (← links)
- Kernelization of edge perfect code and its variants (Q317422) (← links)
- Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
- A linear kernel for planar red-blue dominating set (Q516887) (← links)
- A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing (Q1628680) (← links)
- Maximum matching and kernelization of edge dominating set (Q1751411) (← links)
- Towards optimal kernel for connected vertex cover in planar graphs (Q1949125) (← links)
- An improved linear kernel for complementary maximal strip recovery: simpler and smaller (Q2319903) (← links)
- Towards optimal kernel for edge-disjoint triangle packing (Q2446590) (← links)
- On the kernelization of split graph problems (Q2636501) (← links)
- Circumventing connectivity for kernelization (Q2692730) (← links)
- Kernelization of Two Path Searching Problems on Split Graphs (Q4632190) (← links)
- A 42k Kernel for the Complementary Maximal Strip Recovery Problem (Q4632213) (← links)
- EDGE DOMINATION NUMBER AND THE NUMBER OF MINIMUM EDGE DOMINATING SETS IN PSEUDOFRACTAL SCALE-FREE WEB AND SIERPIŃSKI GASKET (Q5025346) (← links)