Ewa Maria Kubicka is a Polish mathematician interested in graph theory and actuarial science.[1] She is known for introducing the concept of the chromatic sum of a graph, the minimum possible sum when the vertices are labeled by natural numbers with no two adjacent vertices having equal labels.[2]
Kubicka studied mathematics at Wrocław University of Science and Technology beginning in 1974, and earned a master's degree there in 1979. She came to Western Michigan University for graduate study, earning both a master's degree in computer science and a Ph.D. in mathematics in 1989.[1] Her dissertation, The Chromatic Sum and Efficient Tree Algorithms, was supervised by Allen J. Schwenk.[3] She became an assistant professor at Emory University and then, in 1990, moved to the University of Louisville, where she has been a full professor since 2004.[1] At Louisville, she directs the actuarial program and is undergraduate advisor for mathematics.[4]
Kubicka, E.; Kubicki, G.; Vakalis, I. (1990), "Using Graph Distance in Object Recognition", Proceedings of the 1990 ACM annual conference on Cooperation - CSC '90, Proceedings of ACM 1990 Conference, pp. 39–45, doi:10.1145/100348.100355, ISBN0897913485, S2CID8580291.
Erdős, P.; Kubicka, E.; Schwenk, A. (1990), Graphs that require many colors to achieve their chromatic sum, Congressus Numerantium, vol. 71, pp. 17–28.
Kubicka, E. (1990), Constraints on the chromatic sequence for trees and graphs, Congressus Numerantium, vol. 76, pp. 219–230.
Kubicka, E.; Kubicki, G.; Kountanis, D. (1990), Approximation algorithms for the chromatic sum, Proceedings of the First Great Lakes Computer Science Conference, Springer Verlag, pp. 15–21.
Jacobson, M. S.; Kubicka, E.; Kubicki, G. (1991), Vertex rotation number for tournaments, Congressus Numerantium, vol. 82, pp. 201–210.
Kubicka, E.; Kubicki, G. (1992), Constant time algorithm for generating binary rooted trees, Congressus Numerantium, vol. 90, pp. 57–64.
Kubicka, E.; Kubicki, G.; McMorris, F. R. (1992), On agreement subtrees of two binary trees, Congressus Numerantium, vol. 88, pp. 217–224.
Harary, F.; Jacobson, M. S.; Kubicka, E. (1993), The irregularity cost or sum of a graph, Applied Mathematics Letters, vol. 6, pp. 79–80.
^Małafiejski, Michał (2004), "Sum coloring of graphs", in Kubale, Marek (ed.), Graph Colorings, Contemporary Mathematics, vol. 352, Providence, RI: American Mathematical Society, pp. 55–65, doi:10.1090/conm/352/06372, MR2076989