Key points are not available for this paper at this time.
In 1978, Woodall conjectured the following: in a planar digraph, the size of a shortest dicycle is equal to the maximum cardinality of a collection of disjoint transversals of dicycles. We prove that this conjecture is true when the underlying graph is a planar 3-tree.
Juan Gutiérrez (Sun,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: