Tomaž Pisanski

Tomaž Pisanski

Tomaž (Tomo) Pisanski (b. May 24, 1949 in Ljubljana, Slovenia) is a Slovenian mathematician working mainly in graph theory.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" [J.L. Gross and T.W. Tucker, Topological graph theory, Wiley Interscience, 1987] .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 by Dimakopoulos, Palios and Poulakidas.

Pisanski studied at the University of Ljubljana where he obtained a B.Sc., M.Sc and Ph.D. in mathematics. He competed in the 1966 and 1967 International Mathematical Olympiads, winning a bronze medal in 1967. [http://www.imocompendium.com/index.php?options=gl%7Cimotres&imetakm=Pisanski,%20Tomo&p=3999c32] His Ph.D. thesis from topological graph theory was written under the guidance of Torrence Parsons. During his undergraduate studies he was an exchange student at the University of Nancy, France. He also obtained a M.Sc. in computer science from the Pennsylvania State University.

Currently, Pisanski is a professor of discrete and computational mathematics at the University of Ljubljana. Since 2004 he has held a joint position at University of Primorska in Koper. He has taught undergraduate and graduate courses in mathematics and computer science at the University of Zagreb, University of Udine, University of Leoben, California State University, Chico, Simon Fraser University, University of Auckland and Colgate University. From 1998-1999 he was chairman of the Society of Mathematicians, Physicists and Astronomers of Slovenia. In 2005 he was decorated with the Order of Merit (Slovenia), since 2007 Vice President of the International Academy of Mathematical Chemistry, founding editor of the Ars Mathematica Contemporanea.

References

* [http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V0F-4GFNG8H-7&_user=10&_coverDate=10%2F31%2F2005&_rdoc=3&_fmt=summary&_orig=browse&_sort=d&view=c&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=2cbf218b97a638cc8e927154cb083401 Science Direct]
* [http://www.up-rs.si/up-rs/uprs.nsf/dokumentiweb/DA84F4C110E5F57EC1256F89004000C0?OpenDocument Order of Merit (Red za zasluge)]

External links

* [http://www.ijp.si/tomo/papers/vita.htm Pisanski's CV]
* [http://www1.cs.columbia.edu/~sanders/graphtheory/people/random.cgi?Pisanski,+Tomav+z Graph Theory White Pages]
*MathGenealogy|id=20387
* [http://www.disat.unimib.it/chm/Bulletin/IAMC/index.html?ListOfMembers International Academy of Mathematical Chemistry - List of Members]


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Gray graph — infobox graph name = Gray graph image caption = namesake = Marion Cameron Gray vertices = 54 edges = 81 girth = 8 chromatic number = 2 chromatic index = 3 properties = Cubic Semi symmetricIn mathematics, the Gray graph is an undirected bipartite… …   Wikipedia

  • Индекс Винера — (англ. Wiener index), известный также как число Винера (англ. Wiener number), топологический индекс неориентированного графа , определяемый как сумма кратчайших путей (англ.) между вершинами графа …   Википедия

  • Wiener index — In chemical graph theory, the Wiener index (also Wiener number) is a topological index of a molecule, defined as the sum of the numbers of edges in the shortest paths in a chemical graph between all pairs of non hydrogen atoms in a molecule. It… …   Wikipedia

  • Liste de personnes par nombre d'Erdős — Voici une liste non exhaustive de personnes ayant un nombre d Erdős de 0, 1 ou 2. Sommaire 1 #0 2 #1 3 #2 4 Référence …   Wikipédia en Français

  • Einheitsdistanz-Graph — Der Petersen Graph ist ein Einheitsdistanz Graph: er kann so gezeichnet werden, dass jede Kante gleich lang ist. Ein Einheitsdistanz Graph ist ein geometrischer Graph, bei dem jede Kante gleich lang ist. Kanten eines Einheitsdistanz Graphen… …   Deutsch Wikipedia

  • List of Slovenian mathematicians — This is a list of Slovenian mathematicians. NOTOC A B C D E F G H I J K L M N O P Q R S T U V W X Y Z A * Anton Ambschel (1749 1821) B * Vladimir Batagelj (1948 ) * Andrej Bauer (1971 ) * Andrej Blejec (1953 ) * Marijan Blejec (1919 1992) * Marko …   Wikipedia

  • List of University of Ljubljana people — This is a partially sorted list of notable persons who have had ties to the University of Ljubljana.Distinguished faculty Architecture * Jože Plečnik, Architecture * Edvard Ravnikar, Architecture * Ivan Vurnik, ArchitectureThe Arts* Božidar Jakac …   Wikipedia

  • May 24 — << May 2011 >> Su Mo Tu We Th Fr Sa 1 2 3 4 5 …   Wikipedia

  • 1949 — This article is about the year 1949. Millennium: 2nd millennium Centuries: 19th century – 20th century – 21st century Decades: 1910s  1920s  1930s  – 1940s –  1950s   …   Wikipedia

  • VEGA computer algebra system — Vega is a computer algebra system (CAS) for manipulating discrete mathematical structures in Mathematica, a computer software program. The ongoing project is located under mentorship of Tomaž Pisanski at the Department of Theoretical Computer… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”