1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.CO2015
Multi-Eulerian tours of directed graphs
Matthew Farrell, Lionel Levine
Not every graph has an Eulerian tour. But every finite, strongly connected graph has a multi-Eulerian tour, which we define as a closed path that uses each directed edge at least o…
math.CO2015★ 1 cited
CoEulerian graphs
Matthew Farrell, Lionel Levine
We suggest a measure of "Eulerianness" of a finite directed graph and define a class of "coEulerian" graphs. These are the graphs whose Laplacian lattice is as large as possible. A…