3 citations · 4 across the 5 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2023
Reconfiguration of the Union of Arborescences
Yusuke Kobayashi, Ryoga Mahara, Tamás Schwarcz
An arborescence in a digraph is an acyclic arc subset in which every vertex execpt a root has exactly one incoming arc. In this paper, we reveal the reconfigurability of the union…
cs.DM2019★ 3 cited
List colouring of two matroids through reduction to partition matroids
Kristóf Bérczi, Tamás Schwarcz, Yutaro Yamaguchi
In the list coloring problem for two matroids, we are given matroids and on the same ground set , and the goal is to determine the smal…