1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.CC2019
The Complexity of Packing Edge-Disjoint Paths
Jan Dreier, Janosch Fuchs, Tim A. Hartmann +4
We introduce and study the complexity of Path Packing. Given a graph and a list of paths, the task is to embed the paths edge-disjoint in . This generalizes the well known H…
cs.DM2015★ 1 cited
Rainbow domination and related problems on some classes of perfect graphs
Wing-Kai Hon, Ton Kloks, Hsian-Hsuan Liu +1
Let and let be a graph. A function is a rainbow function if, for every vertex with , . The ra…