On a formula for the number of Euler trails for a class of digraphs (Q1356564): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cycle decomposition by transpositions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cycle decomposition by disjoint transpositions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An alternative formula for the number of Euler trails for a class of digraphs / rank | |||
Normal rank | |||
Latest revision as of 13:10, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a formula for the number of Euler trails for a class of digraphs |
scientific article |
Statements
On a formula for the number of Euler trails for a class of digraphs (English)
0 references
15 September 1997
0 references
intersection matrix
0 references
number of Euler trails
0 references
digraph
0 references
