Seymour, Paul. When all directed cycles have length three. Retrieved from https://par.nsf.gov/biblio/10607904. European Journal of Combinatorics 127.C Web. doi:10.1016/j.ejc.2025.104161.

Seymour, Paul. When all directed cycles have length three. European Journal of Combinatorics, 127 (C). Retrieved from https://par.nsf.gov/biblio/10607904. https://doi.org/10.1016/j.ejc.2025.104161

Seymour, Paul. "When all directed cycles have length three". European Journal of Combinatorics 127 (C). Country unknown/Code not available: Science Direct operated by Elsevier. https://doi.org/10.1016/j.ejc.2025.104161. https://par.nsf.gov/biblio/10607904.

@article{osti_10607904,
place = {Country unknown/Code not available}, title = {When all directed cycles have length three}, url = {https://par.nsf.gov/biblio/10607904}, DOI = {10.1016/j.ejc.2025.104161}, abstractNote = {We give a construction to build all digraphs with the property that every directed cycle has length three.}, journal = {European Journal of Combinatorics}, volume = {127}, number = {C}, publisher = {Science Direct operated by Elsevier}, author = {Seymour, Paul}, }