EulerianGraphQ

Available

Test whether a graph has an Eulerian circuit

Forms

EulerianGraphQ[g]

Verified examples{ConnectedGraphQ[g], EulerianGraphQ[g]} → {False, False}

Run this on Qurak Search the reference

Topics

Graph Paths Cycles And Flows - Cycles and Tours
Graph Predicates - Global Structural Properties
Graph Properties And Measurements - Structural Properties
New In80 Alphabetical Listing - E
New In80 Mathematics And Algorithms - New Predicates and Properties »
Summary Of New Features In141 - Graphs & Networks

Related

FindEulerianCycle HamiltonianGraphQ ConnectedGraphQ BipartiteGraphQ AcyclicGraphQ BetweennessCentrality ButterflyGraph ChromaticPolynomial GlobalClusteringCoefficient GraphAssortativity GraphDensity GraphDistanceMatrix

All 6300 functions · Use this from an MCP client