Paths through K-specified edges in a linear graph (Q690196): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Raffaele Scapellato / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Raffaele Scapellato / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:58, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Paths through K-specified edges in a linear graph |
scientific article |
Statements
Paths through K-specified edges in a linear graph (English)
0 references
12 June 1994
0 references
Let \(G\) be a simple, connected and undirected graph, let \(K\) be a set of edges of \(G\), and let \(s\) and \(d\) be two different vertices of \(G\). This paper gives an algorithm to find all paths in \(G\) from \(s\) to \(d\), whose edge-set contains \(K\). The result is based on the fact that, if \(P\) is such a path, the remaining ones take the form \(P \oplus E\), where \(E\) is an Eulerian graph.
0 references
linear graph
0 references
algorithm
0 references
path
0 references
Eulerian graph
0 references
