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.
2016
2016
Eulerian properties of hypergraphs
In this paper we study three substructures in hypergraphs that generalize the notion of an Euler tour in a graph. A flag… 
2008
2008
Eulerian–Lagrangian time-stepping methods for convection-dominated problems
The accuracy and efficiency of several lower and higher order time integration schemes in Eulerian–Lagrangian computations are… 
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
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. 
2004
2004
Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence… 
2004
2004
A Lagrangian multibody code for deriving the symbolic state-space equations of motion for open-loop systems containing flexible beams
2004
2004
Differentials and differential coefficients in the Eulerian foundations of the calculus
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… 
1998
1998
Optimization of planar all-optical multilayer switching architectures
The design of the planar multi-layer switches, obtained by the Euler path through the switch intersection graph (IG), is… 
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)