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.
2018
2018
The irregularity and total irregularity of Eulerian graphs
For a graph G, the irregularity and total irregularity of G are defined as irr(G)=∑_(uv∈E(G))〖|d_G (u)-d_G (v)|〗 and irr_t (G)=1… 
2014
2014
A New Framework for Solving the Spatial Network Problems Based on Line Graphs
In this article we define inverse line graphs of directed graphs as a new framework for solving some classical network analysis… 
2007
2007
Coloring Of Meet-Semilattices
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
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… 
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)