
The polynomial dichotomy for three nonempty part sandwich problems
Keywords: مشکلات ساندویچ; Graph partitions; Sandwich problems; Graph algorithms; Computational complexity; Structural characterization of graphs; NP-complete