Towards a conjecture of Woodall for partial 3-trees
<|reference_start|>Towards a conjecture of Woodall for partial 3-trees: 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.<|reference_end|>
@article{gutiérrez2024towards,
    title={Towards a conjecture of Woodall for partial 3-trees},
    author={Juan Guti'errez},
    journal={arXiv preprint arXiv:2408.05703},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.05703},
    primaryClass={math.CO cs.DM}
}