On Polynomial Kernelization for Stable Cutset
- 22 January 2025
- book chapter
- Published by Springer Nature
- p. 358-373
Abstract
No abstract availableKeywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Exact and Parameterized Algorithms for the Independent Cutset Problem2023
- Matching Cut in Graphs with Large Minimum DegreeAlgorithmica, 2020
- Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithmsDiscrete Applied Mathematics, 2020
- A Completeness Theory for Polynomial (Turing) KernelizationAlgorithmica, 2014
- Data reduction for graph coloring problemsInformation and Computation, 2013
- Fragile graphs with small independent cutsJournal of Graph Theory, 2002
- Stable Set Bonding in Perfect Graphs and Parity GraphsJournal of Combinatorial Theory, Series B, 1993
- Matching cutsets in graphsJournal of Graph Theory, 1989
- Recognizing decomposable graphsJournal of Graph Theory, 1984
- Coloring graphs with stable cutsetsJournal of Combinatorial Theory, Series B, 1983