Rudolf Halin

From Wikipedia, the free encyclopedia

Rudolf Halin (born 1934)[1] is a German graph theorist, known for defining the ends of infinite graphs,[2] for Halin's grid theorem,[3][4] for extending Menger's theorem to infinite graphs,[5] and for his early research on treewidth and tree decomposition.[6] He is also the namesake of Halin graphs, a class of planar graphs constructed from trees by adding a cycle through the leaves of the given tree.[7]

Halin earned his doctorate from the University of Cologne in 1962, under the supervision of Klaus Wagner and Karl Dörge, after which he joined the faculty of the University of Hamburg.[8] In February 1994, a colloquium was held at the University of Hamburg in honor of Halin's 60th birthday.[9]

Selected publications

Research papers

Textbooks

  • Halin, R., Graphentheorie. Vols. I and II published in 1980 and 1981 respectively by Wissenschaftliche Buchgesellschaft.[10] Combined 2nd ed. published in 1989 by Wissenschaftliche Buchgesellschaft.[11]

References

  1. Birth year from U.S. Library of Congress catalogue data.
  2. Halin (1964).
  3. Halin (1965).
  4. Diestel, Reinhard (2004), "A short proof of Halin's grid theorem", Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg 74: 237–242, doi:10.1007/BF02941538, MR 2112834 .
  5. Halin (1974).
  6. Halin (1976).
  7. Halin (1971).
  8. Rudolf Halin at the Mathematics Genealogy Project
  9. Mathematisches Seminar, Univ. of Hamburg, retrieved 2013-02-19.
  10. Vol. I, ISBN 3-534-06767-3. Reviewed by W. Dörfler, MR 0586234. Vol. II, ISBN 3-534-06767-3. Reviewed by W. Dörfler, MR 0668698.
  11. ISBN 3-534-10140-5. MR 1068314.
This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.