Eulerian iterated line graphs and digraphs (Q5959110)
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 1722230
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Eulerian iterated line graphs and digraphs |
scientific article; zbMATH DE number 1722230 |
Statements
Eulerian iterated line graphs and digraphs (English)
0 references
20 March 2002
0 references
The author investigates which iterated line graphs or line digraphs are Eulerian. A characterization of undirected graphs with some iterated line graphs is given. It is proven that every strongly connected digraph has either at most one or infinitely many of its iterated line diagraphs Eulerian.
0 references
Eulerian graph
0 references
line graphs
0 references
digraphs
0 references
characterization
0 references
0.8108165264129639
0 references
0.782209575176239
0 references
0.7766203284263611
0 references
