Abstract. The k-partition problem is as follows: Given a graph G and a positive integer k, partition the vertices of G into at most k parts A1, A2,...,Ak, ...

The list k-partition problem generalizes the k-partition problem by specifying for each vertex x, a list L ( x ) of parts in which it is allowed to be placed.

The k-partition problem is as follows: Given a graph G and a positive integer k, partition the vertices of G into at most k parts A1, A2, . . . , Ak, ...

The k-partition problem is as follows: Given a graph G and a positive integer k, partition the vertices of G into at most k parts A1, A2, . . . , Ak, ...

This work provides polynomial-time algorithms for many problems whose polynomially-time solvability was open, including the list 2-clique cutset problem.

Sep 7, 2017 · I am trying to find an algorithm that would give me for a given graph all minimal cut sets or equivalently all ways to partition the graph in two connected ...

The Complexity of the List Partition Problem for Graphs. Authors. Kathie Cameron · Elaine M. Eschen · Chính T. Hoàng · R. Sritharan. Author ORCID Identifier. < ...

Mar 3, 2012 · I'm interested in this problem: Given an undirected graph G(E,V), Is there a partition of G into graphs G1(E1,V1) and G2(E2,V2) such that G1 and ...

The $k$-partition problem is as follows: Given a graph $G$ and a positive integer $k$, partition the vertices of $G$ into at most $k$ parts $A_1, A_2, ...

TL;DR: In this article, the complexity of the list homomorphism problem was shown to be polynomial-time solvable when H is a bi-arc graph, and is NP-complete if ...