The Reduced Prüfer Code for Rooted Labelled k-Trees (Q3439323): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A coding algorithm for Rényi trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4329049 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3328583 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On acyclic simplicial complexes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3901535 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On simple characterizations of k-trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5607734 / rank | |||
Normal rank |
Latest revision as of 19:08, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Reduced Prüfer Code for Rooted Labelled k-Trees |
scientific article |
Statements
The Reduced Prüfer Code for Rooted Labelled k-Trees (English)
0 references
29 May 2007
0 references
codewords
0 references
k-trees
0 references
Prüfer code
0 references