A sufficient condition for a graph to be weakly ::::k::::-linked

Tomio Hirata, Kiyohito Kubota, Osami Saito. A sufficient condition for a graph to be weakly ::::k::::-linked. Journal of Combinatorial Theory, Series A, 36(1):85-94, 1984. [doi]

Abstract

Abstract is missing.