1 problem
Let be a graph, let denote its line graph, and let denote its maximum degree. An orientation is semi-transitive when it is acyclic and has no shortcuts. Plan…
Let be a graph, let denote its line graph, and let denote its maximum degree. An orientation is semi-transitive when it is acyclic and has no shortcuts. Plan…