Answers are grounded in this paper and cite their sources.
In this correspondence, we comment on the algorithmic method of Smith and Walford for identifying the minimal feedback vertex sets in a digraph, and present other relevant problems and references concerning connectivity in digraphs and graphs.
No takes yet. Share an insight, caveat, or question.
Frank Harary (1975) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: