1 citations · 1 across the 4 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
math.CO2024
When all directed cycles have length three
Paul Seymour
We give a construction to build all digraphs with the property that every directed cycle has length three.
math.CO2024★ 1 cited
Thomassen's theorem on the two-linkage problem in acyclic digraphs: a shorter proof
Paul Seymour
Let G be an acyclic digraph, and let a, b, c, d be vertices, where a, b are sources, c, d are sinks, and every other vertex has in-degree and out-degree at least two. In 1985, Thom…