Chromatic polynomials and k-trees

• Autorzy: Berceanu C.
• Języki publikacji: EN

Abstrakty

EN

Yang counted the number of partitions of the set {1,..., n} satisfying some restrictions. We will solve the same problem using another approach, based on chromatic polynomials.

Słowa kluczowe

EN

Bell number; Stirling's number; graph; chromatic polynomial

• Wydawca: De Gruyter
• Czasopismo: Demonstratio Mathematica
• Rocznik: 2001
• Tom: Vol. 34, nr 4
• Strony: 743--748
• Opis fizyczny: Bibliogr. 3 poz.

Twórcy

autor

Berceanu C.

• Department of Mathematics and Physics University of Bacau 8, Spiru Haret Street 5500 - Bacau, Romania

Bibliografia

• [1] S. D. Sarti, Remarks on umbral evaluations of chromatic polynomials, Discrete Math. 126(1994), 431-437.
• [2] I. Tomescu, Problems in Combinatorics and Graph Theory, Wiley, New York, 1985.
• [3] W. Yang, Bell numbers and k-trees, Discrete Math. 156(1996), 247-252.