10 citations · 19 across the 8 of their papers we have counts for
1 paper · 1 filter
Christoph Brause, Jochen Harant, Florian Hörsch +1
Given a graph G and sets {αv ∣ v∈V(G)} and {βv ∣ v∈V(G)} of non-negative integers, it is known that the decision problem whether G contains a spanning tree $T…