The dissimilarity characteristic theorem for k-supertrees and its application

MaRDI QIDQ5442172zbMATH OpenFDO

Authors Yangtin Liang, Bolian Liu

Publication date 22 February 2008

zbMATH Keywords

enumeration

Mathematics Subject Classification ID

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

Recommendations

• A proof of the dissimilarity characteristic theorem for 2-trees
• scientific article; zbMATH DE number 1028226
• The partition theorem of connected digraphs and its enumerative applications.
• scientific article; zbMATH DE number 4006293
• Cayley theorem on trees enumeration

Cited in

(2)

• A proof of the dissimilarity characteristic theorem for 2-trees
• Counting unlabeled \(k\)-trees

This page was built for publication: The dissimilarity characteristic theorem for \(k\)-supertrees and its application

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