Skip to main content
Log in

A generalization of chromatic polynomial of a graph subdivision

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. C. Berge, Graphs, North-Holland (1985).

  2. G. D. Birkhoff and D. Lewis, “Chromatic polynomials,” Trans. Am. Math. Soc., 60, 355–451 (1946).

    MathSciNet  MATH  Google Scholar 

  3. D. M. Cardoso, J. Szymański, and M. Rostami, Matemática discreta: Combinatória, teoria dos grafos e algoritmos, Escolar Editora, Lisboa (2008).

    Google Scholar 

  4. R. Diestel, Graph Theory, Springer-Verlag (1997).

  5. A. M. Herzberg and M. R. Murty, “Sudoku squares and chromatic polynomials,” Notices Am. Math. Soc., 54, No. 6, 708–717 (2007).

    MathSciNet  MATH  Google Scholar 

  6. R. P. Stanley, Enumerative Combinatorics, Vol. 1, Cambridge Univ. Press (1997).

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to D. M. Cardoso.

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

Reprints 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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10958-012-0745-z

Keywords

Navigation