Skip to search formSkip to main contentSkip to account menu

Eulerian path

Known as: Euler walk, List of impossible figures to redraw, Eulerian tour 
In graph theory, an Eulerian trail (or Eulerian path) is a trail in a graph which visits every edge exactly once. Similarly, an Eulerian circuit or… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this paper we study three substructures in hypergraphs that generalize the notion of an Euler tour in a graph. A flag… 
2009
2009
Testing is essential for digital microfluidic biochips that are used for safety-critical applications such as point-of-care… 
2007
2007
Given a commutative semigroup S with 0, where 0 is the unique singleton ideal, we associate a simple graph Γ(S), whose vertices… 
Highly Cited
2005
Highly Cited
2005
Microfluidics-based biochips are soon expected to revolutionize biosensing, clinical diagnostics and drug discovery. Robust off… 
2004
2004
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. 
2000
2000
We define a noncommutative algebra of flag-enumeration functionals on graded posets and show it to be isomorphic to the free… 
1993
1993
Execution replay is a debugging strategy in which a program is run over and over on an input that manifests bugs. For explicitly… 
1988
1988
This paper introduces a model for parallel computation, called thedistributed randomaccess machine (DRAM), in which the…