Loop conditions for strongly connected digraphs (Q4960455)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Loop conditions for strongly connected digraphs |
scientific article; zbMATH DE number 7190119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Loop conditions for strongly connected digraphs |
scientific article; zbMATH DE number 7190119 |
Statements
Loop conditions for strongly connected digraphs (English)
0 references
16 April 2020
0 references
Maltsev conditions
0 references
loop conditions
0 references
Siggers term
0 references
0 references
0 references
0.9092957
0 references
0 references
0.8846917
0 references
0.8827365
0 references
0.8826753
0 references
0.87958455
0 references
0.87180316
0 references
