Enumerating some stable partitions involving Stirling and r-Stirling numbers of the second kind
DOI10.1007/S00009-018-1130-ZzbMATH Open1439.11071OpenAlexW2800864521WikidataQ129961698 ScholiaQ129961698MaRDI QIDQ723786FDOQ723786
Hacène Belbachir, Mohamed-Amine Boutiche, A. Medjerredine
Publication date: 24 July 2018
Published in: Mediterranean Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00009-018-1130-z
Recommendations
generating functionschromatic polynomialStirling numbers of the second kindset partitions\(r\)-Stirling numbers of the second kinddeletion-contraction principlegraphical Stirling numbersindependent partitionsstablesthorn graphs
Bell and Stirling numbers (11B73) Combinatorial identities, bijective combinatorics (05A19) Coloring of graphs and hypergraphs (05C15) Special sequences and polynomials (11B83) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Cites Work
- Graph Classes: A Survey
- Title not available (Why is that?)
- Stirling numbers of forests and cycles
- Counting the number of non-equivalent vertex colorings of a graph
- Stirling numbers of the second kind and Bell numbers for graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The \(r\)-Stirling numbers
- Coloring mixed hypergraphs: theory, algorithms and applications
- Title not available (Why is that?)
- Rook theory. III: Rook polynomials and the chromatic structure of graphs
- Bell numbers and \(k\)-trees
- Note on some restricted Stirling numbers of the second kind
- Some applications of the chromatic polynomials
- Title not available (Why is that?)
Cited In (5)
- Title not available (Why is that?)
- Ordinary generating function for a class of Appell polynomials and Stirling symmetric polynomials
- Explicit expressions and integral representations for the Stirling numbers: a probabilistic approach
- On the average time complexity of computation with random partition
- Fubini numbers and polynomials of graphs
This page was built for publication: Enumerating some stable partitions involving Stirling and \(r\)-Stirling numbers of the second kind
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q723786)