scientific article; zbMATH DE number 123394

MaRDI QIDQ4025168zbMATH OpenFDO

Authors Bolian Liu

Publication date 18 February 1993

zbMATH Keywords

enumerationhypertrees

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Hypergraphs (05C65)

Recommendations

• Asymptotic sharpness of bounds on hypertrees
• The number of (d,k)-hypertrees
• Bounds on the number of edges of edge-minimal, edge-maximal and l-hypertrees
• Efficient Prüfer-like coding and counting labelled hypertrees
• Enumeration and randomized constructions of hypertrees

Cited in

(10)

• PreLie-decorated hypertrees
• scientific article; zbMATH DE number 6928770 (Why is no real title available?)
• Bounds on the number of edges of edge-minimal, edge-maximal and l-hypertrees
• scientific article; zbMATH DE number 5279360 (Why is no real title available?)
• The number of (d,k)-hypertrees
• Enumeration and randomized constructions of hypertrees
• Enumeration of trees by inversions
• Asymptotic sharpness of bounds on hypertrees
• Enumerative sequences of leaves and nodes in rational trees
• Efficient Prüfer-like coding and counting labelled hypertrees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4025168)