A set of circuits going along the graph edges of a graph, each with an even number of graph edges, such that just one of the circuits passes through each graph vertex (Ball and Coxeter 1987, pp. 265-266).
Tait Cycle
See also
Eulerian Cycle, Graph Edge, Graph Vertex, Hamiltonian Cycle, Tait ColoringExplore with Wolfram|Alpha
References
Ball, W. W. R. and Coxeter, H. S. M. Mathematical Recreations and Essays, 13th ed. New York: Dover, 1987.Referenced on Wolfram|Alpha
Tait CycleCite this as:
Weisstein, Eric W. "Tait Cycle." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/TaitCycle.html