scientific article; zbMATH DE number 5003363

zbMATH Open1082.05011MaRDI QIDQ3369849FDOQ3369849

Authors: Si-Hong Nian, Limin Yang, Yue Liu 

Publication date: 6 February 2006

Title of this publication is not available (Why is that?)

Recommendations

• scientific article
• scientific article; zbMATH DE number 19217
• scientific article; zbMATH DE number 1237933
• The enumeration of irreducible combinatorial objects
• scientific article; zbMATH DE number 4051676
• scientific article; zbMATH DE number 3954967
• One-factorizations of the complete graph—A survey
• scientific article
• Factorizations of some weighted spanning tree enumerators
• The shrinking-and-expanding method for the graph enumeration

zbMATH Keywords

chromatic polynomialFibonacci numbersset partitionStirling numbers

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorial identities, bijective combinatorics (05A19) Enumeration in graph theory (05C30)

Cited In (3)

• Counting formulas \(N[X_1, X_2, \cdots, X_i), k]\) of complete \(i\)-partite graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

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 Q3369849)