The Steiner Multicycle problem consists of, given a complete graph, a we...
Partitioning a connected graph into k vertex-disjoint connected subgraph...
A coloring of the vertices of a connected graph is convex if each color ...
We address the problem of partitioning a vertex-weighted connected graph...
share