A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter

Hoàng-Oanh Le, Van Bang Le. A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter. Theoretical Computer Science, 770:69-78, 2019. [doi]

Abstract

Abstract is missing.