Sign in

Refined Bounds on the Number of Eulerian Tours in Undirected Graphs.

Giulia PunziAlessio ConteRoberto GrossiRomeo Rizzi
Published in: Algorithmica (2024)
Keyphrases
  • undirected graph
  • positive integer
  • upper bound
  • higher order
  • relational databases
  • markov chain
  • spanning tree