Questions tagged [eulerian-path]
This tag is for questions relating to Eulerian paths in graphs. An "Eulerian path" or "Eulerian trail" in a graph is a walk that uses each edge of the graph exactly once. An Eulerian path is "closed" if it starts and ends at the same vertex.
292
questions
1
vote
1
answer
33
views
Worst Case Solution for directed Chinese Postman Problem
The Problem
Let $G$ be a directed graph with $n$ vertices. How long is a shortest circuit that visits every edge in the worst case? That is how long is the solution to the directed Chinese Postman ...
- 11
2
votes
1
answer
26
views
Constructing Paths in a Connected Graph with Odd-Degree Vertices
I am working on a problem and would appreciate some insights or suggestions on how to approach it.
Problem:
Let G = (V, E) be a connected graph where n is the number of vertices in V that are of odd ...
- 65
0
votes
0
answers
33
views
Spanning Trees with 1/2 the edges in a Eulerian Graph
I was attempting the following problem:
Let $G$ be a connected simple graph. (a) If $G$ is eulerian with an even number of vertices, then it has a spanning subgraph $G'$ such that every node $i$ has ...
- 11
1
vote
1
answer
51
views
Finding an Eulerian path on complete graphs
I want to prove the following algorithm to find an Eulerian path in a complete graph:
In the complete graph $K_{n}$ where $n = 2k + 1, k \in \mathbb{Z}^+$, let us label the vertices $1, 2, ..., n$. ...
0
votes
1
answer
40
views
counting Eulerian circuits on complete directed graph
I have a complete directed graph $G$ (including self-loops). How can I count the number of Eulerian circuits on $G$?
For example, in the simple case of $n=2$, there are clearly 4 Eulerian circuits. ...
- 1
-1
votes
1
answer
43
views
What are necessary and sufficient conditions to have a negative cycle in a directed graph with some negative edges? [closed]
Trying to test Johnson’s algorithm with over 100 vertices but it doesn’t work if there is a negative cycle. So I’m trying to write code to construct graphs with some negative weights (about 10% of the ...
- 35
3
votes
1
answer
172
views
Lemma for proving the Euler's theorem
I was studying graph theory when a question came to my mind.
I am referring to a particular way to prove Euler's theorem, viz. the fact that every multigraph (i.e. undirected graph without loops but ...
- 561
0
votes
0
answers
22
views
Proving a graph has an Eulerian path if the components of the graph are both Eulerian.
Suppose that a graph $G$ has a bridge $xy$ such that the components of $G-xy$ are both Eulerian. Prove that G has an Eulerian path. What can you say about the beginning and end of the trail?
I ...
- 1
0
votes
1
answer
57
views
Eulerian Trail proof in Walk Through Combinatorics
I'm struggling with the proof of Eulerian trail in walk through combinatorics.
As you now, the theorem states that "A connected graph G has a closed Eulerian trail if and only if all vertices of ...
- 73
6
votes
1
answer
152
views
Is it possible to go over all lines of a grid with a pencil without lifting it or going over a drawn line?
Is it possible to go over all lines of an infinite grid with a pencil without lifting it or going over a drawn line ?
The pencil can cross through a segment already drawn but cannot go over an already ...
- 308
3
votes
1
answer
189
views
How many ways of traversing every arc of a complete digraph exactly once from a given starting vertex are there?
Given a set of $n$ states $V = \{ s_1, s_2, \ldots, s_n \}$, and a complete digraph $G = (V, A)$ where $A = \{ (a,b) \mid (a,b) \in V^2\; \text{and}\; a \neq b \}$, I'm interested in finding cyclic ...
0
votes
1
answer
53
views
"If a vertex appears $k$ times in an eulerian circuit, then it must have degree $2k$" - Why?
I need help understanding this part of this proof from Graphs and Digraphs (7th ed):
Theorem 3.1. A connected multigraph is eulerian if and only if every vertex has
even degree.
The authors of this ...
- 927
0
votes
0
answers
19
views
Graph theory : Travel to each Edge at least one and returning to the starting Node with the Shortest path in a Weighted Graph?
I would like to travel to each edge of the weighted graph at least once choosing the shortest path, i know this problem is similar to the Chinese Postman Problem CPP, but the difference here is that ...
2
votes
2
answers
86
views
Which is correct Euler path or Euler trail?
Since path cannot have repeated vertices, the definition for
A graph which exactly two vertices have odd degree, and all of its vertices with nonzero degree belong to a single connected component
...
0
votes
1
answer
45
views
Eulerian graph with $46$ vertices and $45$ edges [closed]
Is $G$ a graph which has an isolated vertex and its other connected component is $C_{45}$ an Eulerian graph? To be an Eulerian graph, could it happen that our graph is not connected?
- 893