Now in his fourth decade at the college, Professor Georges continues to teach mathematics with vigor and enthusiasm. He believes that the study of mathematics is an essential part of the liberal arts experience for undergraduates and endeavors to convey his appreciation and respect for the subject to his students. His interactive lecture style encourages students to question their understanding of concepts and to participate in the class. He teaches on a variety of topics including calculus, decision-making, abstract algebra, combinatorics and graph theory.

Active in research, Professor Georges works closely with his departmental colleague Professor Mauro in the investigation of distance-constrained labelings of graphs, an area of graph theory that addresses some of the problems arising in the design of communications networks. On several past occasions these investigations have led to research opportunities for highly motivated undergraduates.

Professor Georges is mindful of the college's obligation to support educational efforts in the Greater Hartford Community. He has made numerous presentations on the history of mathematics to middle and high school students enrolled in Hartford's Classical Magnet Program, has offered lecture series on probability to students at Windsor High School, and has served on the advisory board of Math Connections, a regional secondary school mathematics initiative funded by the National Science Foundation.

Research Publications

• Choi, J., J.P. Georges and D.W. Mauro. "On the zero sum Z_k magic labelings of 3-regular graphs." Graphs and Combinatorics Vol. 29 (2013): 387-398.
• Choi, J., J.P. Georges, D.W. Mauro and Y. Yang. "On real number labelings and graph invertibility." Discrete Applied Mathematics Vol.160 (2012): 2116-2130.
• Choi, J., J.P. Georges and D.W. Mauro. "Relating edge coverings to the classification of _^Z2^k magic graphs." Discrete Mathematics Vol. 312 (2012): 2938-2945.
• Georges, J.P., D.W. Mauro and Y. Yang. "On the structures of V₄ and Z₄-magic graphs." JCMCC Vol. 75 (2010): 137-152.
• Georges, J.P., K. Gochev, D.W. Mauro and Y. Yang. "Some results on r-paths labeled with a condition at distance two." Congressus Numerantium Vol. 198 (2009): 95-109.
• Georges, J.P., D.W. Mauro and Y. Yang. "Labeling the r-path with a condition at distance two." Discrete Applied Mathematics Vol. 157 (2009): 3203-3215.
• Georges, J.P., and D.W. Mauro. “On the structure of graphs with non-surjective L(2, 1)-labelings.” SIAM Journal on Discrete Mathematics Vol. 19 (2005): 208-223.
• Georges, J.P., and D.W. Mauro. “A note on collections of graphs with non-surjective lambda labelings.” Discrete Applied Mathematics Vol. 146, (2005): 92-98.
• Erwin, D., J.P. Georges, and D.W. Mauro. “On labeling the products of complete graphs with distance constraints.” Naval Research Logistics Vol. 52, #2 (2005): 138-141.
• Georges, J.P.,  and D.W. Mauro. “Edge labelings with a condition at distance two.” Ars Combinatoria Vol. 70, (2004): 109-128. 
• Georges, J.P., and D.W. Mauro. “On regular graphs optimally labeled with a condition at distance two.” SIAM Journal on Discrete Mathematics Vol. 17, (2003): 320-331.
• Georges, J.P., and D.W. Mauro. “Labeling trees with a condition at distance two.” Discrete Mathematics Vol. 269, (2003): 127-148.
• Georges, J.P., and D.W. Mauro. “On generalized Petersen graphs labeled with a condition at distance two.” Discrete Mathematics Vol. 259, (2002): 311-318.
• Georges,  J.P.,  D.W. Mauro, and M. Stein. “Labeling Products of Complete Graphs with a Condition at Distance Two.”  SIAM Journal on Discrete Mathematics Vol. 14, (2001): 28-35.
• Georges, J.P., and D.W. Mauro. “On the size of graphs labeled with a condition at distance two.” Journal of Graph Theory Vol. 22, #1 (1996): 47-57.
• Georges, J.P., D.W. Mauro, and M.A. Whittlesey. “On the l-Number of Qn and related graphs.” SIAM Journal of Discrete Mathematics Vol. 8, #4 (1995): 499-506.