A note on matching-cut in \(P_t\)-free graphs

DOI10.1016/j.ipl.2022.106294OpenAlexW4282919382MaRDI QIDQ2094374

Carl Feghali

Publication date: 28 October 2022

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.12011

zbMATH Keywords

computational complexitymatching-cut\(P_t\)-free graph

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Finding matching cuts in \(H\)-free graphs ⋮ On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs

Cites Work

• Dominating cliques in \(P_ 5\)-free graphs
• On stable cutsets in line graphs
• A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter
• Nearly perfect sets in graphs
• Recognizing decomposable graphs
• The complexity of the matching-cut problem for planar graphs and other graph classes
• My Top 10 Graph Theory Conjectures and Open Problems
• Matching cut in graphs with large minimum degree

This page was built for publication: A note on matching-cut in \(P_t\)-free graphs