References
- K.-P. Bogart, "Introductory Combinatorics, 2nd. edition," Harcourt Brace Jovanovich, Publishers and its subsidiary, Academic Press, 1989.
- M. T.-Nasseef, “Counting Symmetries with Burnside's Lemma and Polya's Theorem,” European Journal of Pure and Applied Mathematics, Vol. 9, No. 1, pp. 84-113, 2016.
- C.-Berge, "Principles of Combinatorics," Academic Press, New York, 2006.
- L. A.-Goldberg and M.-Jerrum, “The Burnside Process' Converges Slowly, Combinatorics,” Probability and Computing, Vol. 11, No. 1, pp. 21-34, 2002. https://doi.org/10.1017/S096354830100493X
- N.-Vilenkin, "Combinatorics," Academic Press, New York, 1971.
- C. J.-Colbourn, J. S.-Provan and D.-Vertigan, "A new approach to solving three combinatorial enumeration problems on planar graphs," Discrete Applied Mathematics, Vol. 60, pp. 119-129, 1995. https://doi.org/10.1016/0166-218X(95)E0111-3
- H. J.-Lai, Y.-Liang, P.-Li and JinquanXu, "Degree sequences and graphs with disjoint spanning trees," Discrete Applied Mathematics, Vol. 159, pp. 1447-1452, 2011. https://doi.org/10.1016/j.dam.2011.05.009
- S.-Kim, "Distributive lattices, affine semigroups, and branching rules of the classical groups," Journal of Combinatorial Theory, Series A, Vol. 119, pp. 1132-1157, 2012. https://doi.org/10.1016/j.jcta.2012.02.007
- R. A.-Brualdi, "Introductory Combinatorics," Prentice Hall, New Jersey, 2015.