The problem remains NP-hard even if we restrict our attention to bipartite graphs whose bipartite dimension is guaranteed to be at most O ( log n ) {\displaystyle O(\log \,\!n)} , with n denoting the size of the given problem instance (Gottlieb, Savage & Yerukhimovich 2005).
Problem ostaje NP-težak, čak i ako ograničimo našu pažnju na bipartitne grafove čija je bipartitna dimenzija zagarantovana da bude najviše O ( log n ) {\displaystyle O(\log \,\!n)} , gde n označava veličinu datog problema (Gottlieb, Savage & Yerukhimovich 2005).