Complexity of determining if the edges of a directed graph can be partitioned into edge-disjoint simple cycles of length $>k$

A record is what was published and who pointed at it. The text of the post is not held here: read it at the source, or at its Wayback capture.

First cited

—

Most recent

—

Rank this month

not ranked

Links from this post

4

Words captured

399