Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,216,476 papers from all fields of science
Search
Sign In
Create Free Account
Eulerian path
Known as:
Euler walk
, List of impossible figures to redraw
, Eulerian tour
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
30 relations
BEST theorem
Bioinformatics
Bridge (graph theory)
CMOS
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Catlin's conjecture and maximum eulerian subgraph
N. Haghparast
2018
Corpus ID: 119684463
A graph $G=(V(G), E(G))$ is supereulerian if it has a spanning Eulerian subgraph. Let $\ell(G)$ be the maximum number of edges of…
Expand
2017
2017
DNA-inspired Basketmaking: Scaffold-Strand Construction of Wireframe Sculptures
James Mallos
2017
Corpus ID: 56435754
A recent achievement in nanotechnology has been self-assembly of wireframe models from scaffold strand DNA— long single strands…
Expand
2016
2016
AOE-Trails Constructing for a Plane Connected 4-Regular Graph
T. Makarovskikh
,
A. Panyukov
International Conference on Discrete Optimization…
2016
Corpus ID: 11246724
The polynomial algorithm for constructing a special Eulerian cycle in a plane connected 4-regular graph G = (V,E) is presented in…
Expand
2016
2016
Eulerian properties of hypergraphs
M. A. Bahmanian
,
Mateja Šajna
2016
Corpus ID: 119306239
In this paper we study three substructures in hypergraphs that generalize the notion of an Euler tour in a graph. A flag…
Expand
2008
2008
P 3 M-SPH simulations of the Lyman-α Forest
T. Theuns
,
A. Leonard
,
G. Efstathiou
,
F. Pearce
,
P. Thomas
2008
Corpus ID: 15236318
We investigate the importance of several numerical artifacts such as lack of resolution on spectral properties of the Lyman…
Expand
2006
2006
Issues on Gas-Fabric Interaction in Airbag Simulation Using LS-DYNA ALE Ning
Ning Zhang
,
Linhuo Shi
,
Gosei North Amercia
,
Bruce Tzeng
2006
Corpus ID: 30895110
Computer Aided Engineering (CAE) has been deployed to help developing effective occupant restraint systems, such as airbags, in…
Expand
2005
2005
Approche technologique de la récupération du ballon lors de la phase défensive en football, contribution à l'élaboration de contenus de formation innovants
E. Duprat
2005
Corpus ID: 159962153
Dans le football, comme dans l'ensemble des sports collectifs, les auteurs s'accordent pour affirmer qu'il est plus facile de…
Expand
2002
2002
Analysis of multistage linear parallel interference cancellation in CDMA systems using graphical representation
Chien-Hwa Hwang
,
C. Kim
,
C.-C. Jay Kuo
IEEE International Conference on Communications…
2002
Corpus ID: 39182787
The bit error probability of the multistage linear parallel interference canceller in a long-code code division multiple access…
Expand
2001
2001
On the Parity of Graph Spanning Tree Numbers
D. Eppstein
2001
Corpus ID: 8666306
Any bipartite Eulerian graph, any Eulerian graph with evenly many vertices, and any bipartite graph with evenly many vertices and…
Expand
1985
1985
Of planar Eulerian graphs and permutations
G. Moran
1985
Corpus ID: 54194268
On utilise des graphes euleriens planaires infinis pour montrer que pour ν>0 le nombre recouvrement du groupe simple infini H…
Expand