Pages that link to "Item:Q355502"

The following pages link to Planar graph vertex partition for linear problem kernels (Q355502):

Displaying 7 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)