A REFINED ENUMERATION OF p-ARY LABELED TREES (Q5016351): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4040797 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A generalized enumeration of labeled trees and reverse Prüfer algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the enumeration of rooted trees with fixed size of maximal decreasing trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4948575 / rank | |||
Normal rank | |||
Latest revision as of 12:54, 27 July 2024
scientific article; zbMATH DE number 7443925
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A REFINED ENUMERATION OF p-ARY LABELED TREES |
scientific article; zbMATH DE number 7443925 |
Statements
A REFINED ENUMERATION OF p-ARY LABELED TREES (English)
0 references
13 December 2021
0 references
\(p\)-ary labeled tree
0 references
refinement
0 references
maximal decreasing subtree
0 references
