An algorithmic characterization of total digraphs (Q3722533)
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 3952805
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithmic characterization of total digraphs |
scientific article; zbMATH DE number 3952805 |
Statements
An algorithmic characterization of total digraphs (English)
0 references
1986
0 references
directed graphs
0 references
total graphs
0 references
total digraphs
0 references
recognition algorithm
0 references
0.7356813549995422
0 references
0.7235937714576721
0 references
