Abstract
In a graph, a matching cut is an edge cut that is a matching. Matching Cut is the problem of deciding whether or not a given graph has a matching cut, which is known to be \({\textsf {NP}}\)-complete. While Matching Cut is trivial for graphs with minimum degree at most one, it is \({\textsf {NP}}\)-complete on graphs with minimum degree two.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call