Eulerian paths and a problem concerning \(n\)-arc connected spaces (Q386187): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.topol.2013.10.030 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2092810208 / rank | |||
Normal rank | |||
Revision as of 21:34, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Eulerian paths and a problem concerning \(n\)-arc connected spaces |
scientific article |
Statements
Eulerian paths and a problem concerning \(n\)-arc connected spaces (English)
0 references
9 December 2013
0 references
In this paper, the authors build an example of an \(n\)-arc connected (metric) continuum, which is not a \((n+1)\)-arc connected for every \(n \geq 7\) using Euler's Theorem: A graph has a surjective Eulerian path if and only if it has at most two odd vertices.
0 references
\(n\)-arc connected
0 references
graph
0 references
