FindEulerianCycle

 FindEulerianCycle(graph)

find an eulerian cycle in the graph.

See

• Wikipedia - Eulerian path

Examples

>> FindEulerianCycle(Graph({1 -> 2, 2 -> 3, 3 -> 4, 4 -> 1}))
{4->1,1->2,2->3,3->4}

>> FindEulerianCycle(Graph({1 -> 2, 2 -> 3, 3 -> 4, 3 -> 1}))
{}

Related terms

GraphCenter, GraphDiameter, GraphPeriphery, GraphRadius, AdjacencyMatrix, EdgeList, EdgeQ, EulerianGraphQ, FindHamiltonianCycle, FindVertexCover, FindShortestPath,FindShortestTour, FindSpanningTree, Graph, GraphQ, HamiltonianGraphQ, VertexEccentricity, VertexList, VertexQ

Implementation status

• ✅ - full supported

Github

• Implementation of FindEulerianCycle