All Questions
Tagged with eulerian-path recreational-mathematics
4
questions
-1
votes
1
answer
43
views
Eulerian trail (or Eulerian path) [closed]
I found this question in one oldie book
It is possible to draw figure A below without lifting your pencil in such a way that you never draw the same line twice. However, no matter how hard you try, ...
- 27
1
vote
1
answer
194
views
What graphs have k-Eulerian circuits without backtracking?
Yesterday I asked about k-Eulerian circuits and which graphs have them.
What I mean by k-Eulerian circuits is a sequence of edges $\{e_i\}_{i=1}^n$ such that $e_i$ and $e_{i+1}$ are connected to a ...
- 14.7k
1
vote
2
answers
366
views
Generalization of Euler Circuits that Visit Each Edge $k$-times
It is known that a graph has an Eulerian circuit if and only if each node has even degree. Two questions: (1) What is the term used to describe a cycle (if the right term) that visits each edge in a ...
- 14.7k
37
votes
12
answers
134k
views
Is it possible to draw this picture without lifting the pen?
Some days ago, our math teacher said that he would give a good grade to the first one that will manage to draw this:
To draw this without lifting the pen and without tracing the same line more than ...
- 641