Abstract
Considering the partitions of a set into nonempty subsets, we obtain an expression for the number of all partitions of a given type. The chromatic polynomial of a graph subdivision is generalized, considering two sets of colors, and a general explicit expression is obtained for this generalization. Using these results, we determine the generalized chromatic polynomial for the particular case of complete graph subdivision.
Similar content being viewed by others
References
C. Berge, Graphs, North-Holland (1985).
G. D. Birkhoff and D. Lewis, “Chromatic polynomials,” Trans. Am. Math. Soc., 60, 355–451 (1946).
D. M. Cardoso, J. Szymański, and M. Rostami, Matemática discreta: Combinatória, teoria dos grafos e algoritmos, Escolar Editora, Lisboa (2008).
R. Diestel, Graph Theory, Springer-Verlag (1997).
A. M. Herzberg and M. R. Murty, “Sudoku squares and chromatic polynomials,” Notices Am. Math. Soc., 54, No. 6, 708–717 (2007).
R. P. Stanley, Enumerative Combinatorics, Vol. 1, Cambridge Univ. Press (1997).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 71, Algebraic Techniques in Graph Theory and Optimization, 2011.
Rights and permissions
About this article
Cite this article
Cardoso, D.M., Silva, M.E. & Szymański, J. A generalization of chromatic polynomial of a graph subdivision. J Math Sci 182, 246–254 (2012). https://doi.org/10.1007/s10958-012-0745-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-012-0745-z