Conflict-free cuts exist in all planar 4-regular graphs with 1-regular conflicts except the octahedron, but the decision problem is NP-complete for planar and 3-degenerate graphs of maximum degree 5.
Matching cut: kernel- ization, single-exponential time FPT, and exact exponential algorithms.Discrete Applied Mathematics, 283:44–58
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Conflict-Free Cuts in Planar and 3-Degenerate Graphs with 1-Regular Conflicts
Conflict-free cuts exist in all planar 4-regular graphs with 1-regular conflicts except the octahedron, but the decision problem is NP-complete for planar and 3-degenerate graphs of maximum degree 5.