1 problem
Let be a -regular tripartite digraph with three vertex classes, each of size , meaning that every vertex has indegree and outdegree . A Hamilton cycle is a directed…
Let be a -regular tripartite digraph with three vertex classes, each of size , meaning that every vertex has indegree and outdegree . A Hamilton cycle is a directed…