The partition theorem of connected digraphs and its enumerative applications. (Q2804790)
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: The partition theorem of connected digraphs and its enumerative applications. |
scientific article; zbMATH DE number 6577871
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The partition theorem of connected digraphs and its enumerative applications. |
scientific article; zbMATH DE number 6577871 |
Statements
4 May 2016
0 references
connected graphs
0 references
digraph
0 references
partition
0 references
recursive formula
0 references
The partition theorem of connected digraphs and its enumerative applications. (English)
0 references
0.7778470516204834
0 references
0.7765748500823975
0 references
0.7738162279129028
0 references
0.7547168731689453
0 references
