






















Azuma et al.\ showed that a strongly connected digraph without a doubly bidirectionally connected pair is cactus-expandable. We prove the converse: if a digraph has a doubly bidirectionally connected pair, then no expansion of it is a cactus digraph. Combined with the theorem of Azuma et al., this yields a characterization of strongly connected cactus-expandable digraphs.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。