25 citations · 25 across the 1 of their papers we have counts for
1 paper · 1 filter
Sarah Bailey, Michael Keane, Karl Petersen +1
The Euler graph has vertices labelled (n,k) for n=0,1,2,... and k=0,1,...,n, with k+1 edges from (n,k) to (n+1,k) and n-k+1 edges from (n,k) to (n+1,k+1). The number of paths from…