Structural graph theory
January 15, 2021 EDT

On partitioning the edges of an infinite digraph into directed cycles

ccby-4.0
Photo by Lyndon Li on Unsplash
Joó, Attila. 2021. “On Partitioning the Edges of an Infinite Digraph into Directed Cycles.” Advances in Combinatorics, January. https://doi.org/10.19086/aic.18702.