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)

Related topics

Related topics

30 relations
BEST theoremBioinformaticsBridge (graph theory)CMOS

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three
A colored eulerian digraph is an eulerian digraph $G$ where a color is assigned to the tail of each edge and a color is assigned… 
2009
2009
Design-for-Testability for Digital Microfluidic Biochips
Testing is essential for digital microfluidic biochips that are used for safety-critical applications such as point-of-care… 
Highly Cited
2005
Highly Cited
2005
Defect-oriented testing and diagnosis of digital microfluidics-based biochips
Microfluidics-based biochips are soon expected to revolutionize biosensing, clinical diagnostics and drug discovery. Robust off… 
2004
2004
Differentials and differential coefficients in the Eulerian foundations of the calculus
2004
2004
A Lagrangian multibody code for deriving the symbolic state-space equations of motion for open-loop systems containing flexible beams
2004
2004
Note on Counting Eulerian Circuits
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. 
2000
2000
Noncommutative Enumeration in Graded Posets
We define a noncommutative algebra of flag-enumeration functionals on graded posets and show it to be isomorphic to the free… 
1996
1996
Chip-Firing Games on Mutating Graphs
We investigate a generalization of a chip-firing game on a graph of Bjorner, Lovasz, and Shor [European J. Combin., 1 (1992), pp… 
1993
1993
Trace Size vs. Parallelism in Trace-and-Replay Debugging of Shared-Memory Programs
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
Communication-efficient parallel algorithms for distributed random-access machines
This paper introduces a model for parallel computation, called thedistributed randomaccess machine (DRAM), in which the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)