Graphs for which all strong orientations are Eulerian (Q789400): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 01:14, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs for which all strong orientations are Eulerian |
scientific article |
Statements
Graphs for which all strong orientations are Eulerian (English)
0 references
1984
0 references
The authors show that every strong orientation of a connected Eulerian graph G is Eulerian if and only if any two distinct cycles of G intersect in at most one vertex.
0 references
Eulerian digraphs
0 references
strong orientations
0 references
