When all directed cycles have length three
Paul Seymour
TL;DR
This paper presents a construction method to generate all directed graphs where every cycle has exactly three edges, providing a comprehensive characterization of such digraphs.
Contribution
The authors introduce a novel construction technique that characterizes all digraphs with only three-length directed cycles.
Findings
Complete characterization of digraphs with all cycles of length three
A construction method to generate all such digraphs
Insight into the structure of these specialized digraphs
Abstract
We give a construction to build all digraphs with the property that every directed cycle has length three.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Mathematics and Applications · Coding theory and cryptography