Reachability in graphs having linear 2-arboricity two is NL-hard

Ronak Bhadra, Raghunath Tewari. Reachability in graphs having linear 2-arboricity two is NL-hard. Inf. Process. Lett., 192:106611, 2026. [doi]

Abstract

Abstract is missing.