Carl Seaquist

Learn More
We define an orientable one-circuit double cover of a graph as a walk that starts and ends at the same vertex and traverses each edge of the graph exactly twice, once in each direction, but never in immediate succession. We characterize the graphs that have an orientable one-cycle double cover.
  • 1