Tomaž Pisanski
Tomaž Pisanski is a Slovenian mathematician working mainly in discrete mathematics and graph theory. He is considered by many Slovenian mathematicians to be the "father of Slovenian discrete mathematics."
Biography
As a high school student, Pisanski competed in the 1966 and 1967 International Mathematical Olympiads as a member of the Yugoslav team, winning a bronze medal in 1967. He studied at the University of Ljubljana where he obtained a B.Sc, M.Sc and PhD in mathematics. His 1981 PhD thesis in topological graph theory was written under the guidance of Torrence Parsons. He also obtained an M.Sc. in computer science from Pennsylvania State University in 1979.Currently, Pisanski is a professor of discrete and computational mathematics and Head of the Department of Information Sciences and Technology at University of Primorska in Koper. In addition, he is a professor at the University of Ljubljana Faculty of Mathematics and Physics. He has been a member of the Institute of Mathematics, Physics and Mechanics in Ljubljana since 1980, and the leader of several IMFM research projects. In 1991 he established the Department of Theoretical Computer Science at IMFM, of which he has served as both head and deputy head.
He has taught undergraduate and graduate courses in mathematics and computer science at the University of Ljubljana, University of Zagreb, University of Udine, University of Leoben, California State University, Chico, Simon Fraser University, University of Auckland and Colgate University. Pisanski has been an adviser for M.Sc and PhD students in both mathematics and computer science. Notable doctoral students include Vladimir Batagelj, Bojan Mohar, and Sandi Klavžar.
Research
Pisanski’s research interests span several areas of discrete and computational mathematics, including combinatorial configurations, abstract polytopes, maps on surfaces, chemical graph theory, and the history of mathematics and science. In 1980 he calculated the genus of the Cartesian product of any pair of connected, bipartite, d-valent graphs using a method that was later called the White–Pisanski method. In 1982 Vladimir Batagelj and Pisanski proved that the Cartesian product of a tree and a cycle is Hamiltonian if and only if no degree of the tree exceeds the length of the cycle. They also proposed a conjecture concerning cyclic Hamiltonicity of graphs. Their conjecture was proved in 2005. With Brigitte Servatius he is the co-author of the book Configurations from a Graphical Viewpoint.Selected publications
- Pisanski, T. Genus of Cartesian products of regular bipartite graphs, Journal of Graph Theory 4, 1980, 31-42.
- Graovac, A., T. Pisanski. On the Wiener index of a graph, Journal of Mathematical Chemistry 8,1991, 53-62.
- Boben, M., B. Grunbaum, T. Pisanski, A. Zitnik, Small triangle-free configurations of points and lines, Discrete & Computational Geometry 35, 2006, 405-427.
- Conder, M., I. Hubard, T. Pisanski. Constructions for chiral polytopes, Journal of the London Mathematical Society 77, 2007, 115-129.
- Pisanski, T. A classification of cubic bicirculants, Discrete Mathematics 307, 2007, 567-578.