The specification of 2-trees (Q696853): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Combinatorial addition formulas and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5596092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of labeled k-dimensional trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Central and local limit theorems applied to asymptotic enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Methods in Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simple characterizations of k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic simplicial complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some relations between 2-trees and tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5616724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of labeled 2-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Plane 2-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5607734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The game coloring number of pseudo partial \(k\)-trees / rank
 
Normal rank

Revision as of 16:02, 4 June 2024

scientific article
Language Label Description Also known as
English
The specification of 2-trees
scientific article

    Statements

    The specification of 2-trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 September 2002
    0 references
    The authors obtain a number of relations, including a dissymmetry theorem, for enumerating various types of 2-trees. For example, they give recurrence relations for the number of unlabelled rooted and unrooted 2-trees; and they determine the asymptotic behaviour of the number of unlabelled 2-trees and the number of oriented-edge rooted 2-trees.
    0 references
    enumeration
    0 references
    0 references

    Identifiers