Graphs for which all strong orientations are Eulerian (Q789400)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3845618
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs for which all strong orientations are Eulerian |
scientific article; zbMATH DE number 3845618 |
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
0.810360848903656
0 references
0.8091081976890564
0 references
0.8068552017211914
0 references
0.7886598110198975
0 references
0.7753710746765137
0 references
