3 citations · 3 across the 7 of their papers we have counts for
1 paper · 1 filter
Loukas Georgiadis, Evangelos Kosinas
A directed graph G=(V,E) is twinless strongly connected if it contains a strongly connected spanning subgraph without any pair of antiparallel (or twin) edges. The twinless stron…