Heinz-Jürgen Voss (mathematician)

from Wikipedia, the free encyclopedia

Heinz-Jürgen Voss (born February 10, 1938 in Bitterfeld ; † September 7, 2003 in Berlin ) was a German mathematician , professor of algebra , especially for graph theory . Since 1983 he has taught in Dresden , since 1992 as professor for graph theory / classical algebra at the Institute for Algebra at the Mathematical Faculty of the TU Dresden .

Professional background

In 1956 Voss passed the Abitur at the secondary school in Bitterfeld and completed a degree in mathematics at the TH Dresden , which he completed in 1962 as a graduate mathematician (diploma thesis: "Extension of the Ritz-Galerkin method to systems of differential equations", with Helmut Heinrich, TH Dresden). From 1962 (until 1979) he was assistant at the TH Ilmenau , finally senior assistant. In 1966 he obtained his doctorate as Dr. rer. nat. (Dissertation: “About the waist size in graphs that contain exactly k node-independent circles, and about the number of nodes that represent all circles in such graphs”, predicate: summa cum laude, from Horst Sachs, TH Ilmenau, first reviewer). In 1969/70 Voss completed additional studies at the Humboldt University in Berlin , in 1972 he completed his habilitation at the TH Ilmenau (Dr.sc.nat .; 1991: conversion to Dr. rer. Nat. Habil.) And obtained a Facultas Docendi for the field of mathematics (dissertation B / habilitation thesis: "About properties of graphs that contain a given number of independent circles or the circles have a prescribed length", from Horst Sachs, TH Ilmenau, first reviewer). 1979/80 he was visiting professor at the University of Chisinau / USSR . In 1979 he was a lecturer in mathematical methods of surgical research at the TH Ilmenau. In 1983 Voss was offered a professorship for algebra at the University of Education "Karl Friedrich Wilhelm Wander" Dresden (PHD). From 1992 to 2003 he was Professor of Graph Theory / Classical Algebra at the Institute for Algebra at the Faculty of Mathematics and Natural Sciences at TU Dresden .

family

Voss was married to Waltraud Voss (born Leuteritz in 1944), with whom he had three sons (Hartmut, Horst-Hermann and Heinz-Jürgen ).

Publications

Books

  • Cycles and Bridges in Graphs. - In the series “Mathematics and Its Applications (East European Series)” Vol. 49 at Kluwer Acad. Publ. Dordrecht / Boston / London 1991, and in the series “Mathematische Monographien” Vol. 23 at Deutscher Verlag der Wissenschaften, Berlin 1991, ISBN 0792308999 .
  • With H. Walther: About circles in graphs. Deutscher Verlag der Wissenschaften, Berlin 1974 (Walther, H .: part I: "longest circles", Voss, H.-J .: part II: "independent circles and circles of prescribed length")
  • Description of groups and triangulations of orientable surfaces. Chapter 5 in Graph Theory Volume 1: Applications to topology, group theory and lattice theory by K. Wagner and R. Bodendiek. BI - Scientific Publishing house Mannheim / Vienna / Zurich 1989; 92-156, ISBN 3860258885 .
  • Author of the subject area graph theory of the book Lexikon der Mathematik (Ed .: Walter Gellert, Herbert Kästner , Siegfried Neuber). Bibliographical Institute Leipzig 1977.

Publications in journals and conference proceedings (selection)

  • Stanislav Jendrol, Heinz-Jürgen Voss: Light subgraphs of graphs embedded in the plane - A survey. Discrete Mathematics (DM) 313 (4): 406-421 (2013)
  • Madaras, Tomás; Skrekovski, Riste; Voss, Heinz-Jürgen: The 7-cycle C7 is light in the family of planar graphs with minimum degree 5. - In: Discrete Mathematics 307 (11-12) (2007); Pp. 1430-1435
  • Kaiser, Tomás; Ryjácek, Zdenek; Král, Daniel; Rosenfeld, Moshe; Voss, Heinz-Jürgen: Hamilton cycles in prisms. - In: Journal of Graph Theory 56 (4) (2007); Pp. 249-269
  • Daniel Král, Jan Kratochvíl, Andrzej Proskurowski, Heinz-Jürgen Voss: Coloring mixed hypertrees. - Discrete Applied Mathematics 154 (4): 660-672 (2006)
  • Vitaly I. Voloshin, Heinz-Jürgen Voss: Circular mixed hypergraphs II: The upper chromatic number. - Discrete Applied Mathematics 154 (8): 1157-1172 (2006)
  • Stanislav Jendrol, Heinz-Jürgen Voss: Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds. - Eur. J. Comb. 26 (3-4): 457-471 (2005)
  • Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss: Mixed hypercacti. - Discrete Mathematics 286 (1-2): 99-113 (2004)
  • Daniel Král, Heinz-Jürgen Voss: Edge-disjoint odd cycles in planar graphs. - J. Comb. Theory, Ser. B 90 (1): 107-120 (2004)
  • Stanislav Jendrol, Heinz-Jürgen Voss: Light subgraphs of multigraphs on compact 2-dimensional manifolds. - Discrete Mathematics 233 (1-3): 329-351 (2001)
  • Vladimir P. Korzhik, Heinz-Jürgen Voss: On the number of nonisomorphic orientable regular embeddings of complete graphs. - J. Comb. Theory, Ser. B 81 (1): 58-76 (2001)
  • Stanislav Jendrol, Heinz-Jürgen Voss: A local property of polyhedral maps on compact two-dimensional manifolds. - Discrete Mathematics 212 (1-2): 111-120 (2000)
  • A. Niculitsa, V. Voloshin, H.-J. Voss: Uniquely colorable and circular mixed hypergraphs. 6-th Twente Workshop on Graphs and Combinatorial Optimization, 26-28 May, 1999, pp. 173-176 (eds .: HJ Broersma, U. Faigle, JL Hurink, University of Twente)
  • Symmetries of group triangulations. - In: Topics in Combinatorics and Graph Theory (ed. By R. Bodendiek and R. Henn). Physica-Verlag Heidelberg 1990; 693-711
  • Maximum even and odd circles in graphs II. Z. TH Ilmenau 35 (1989) 3; 55-64
  • Renaissance of the mathematics of discrete structures. - Scientific Z. PH Dresden. Math.-Nat. Series 20 (1986); 51-58
  • Bridges of circuits through specified edges. - In: Graphs, Hypergraphs and Applications. Proc. Conf. Graph Theory, held at Eyba, Oct. 1984. - Teubner texts on Math. 73, BG Teubner Leipzig 1985; 198-202
  • Independent sets in k-chromatic graphs. - Combinatorica 5 (3): 261-269 (1985)
  • Coloring problems on graphs. - Scientific Z. PH Dresden, Math.-Nat. Series 18 (1984); 9-27
  • Independent sets in (k + 1) -colorations of k-chromatic graphs. - Scientific Z. TH Ilmenau 30 (1984) 1; 27-36
  • Graphs having circuits with at least two chords. - J. Comb. Theory, Ser. B 32 (3): 264-285 (1982)
  • Bridges of longest circuits and of longest paths in graphs. - Contributions to graph theory and its applications. - Intern. Koll. Oberhof 1977; 275-286
  • Properties of doubly connected graphs with a prescribed maximum circle length. - Communications from MGdDDR 2-3 (1973); 139-151
  • Properties of graphs that contain k, but no k + 1 circles outside the edge. - Contributions to graph theory (Internat. Koll. Manebach 1967), Teubner-Verlag Leipzig; 169-184
  • About the waist size in graphs that contain a maximum of k independent circles, and about the number of nodes that represent all circles. - X. Internat. Knowledge Koll. TH Ilmenau 1965. Lecture series “Mathematical Problems in Economics and Computing Technology”; 11/1966; 23-27

Web links

Individual evidence

  1. TU Dresden University professors emeritus of the Faculty of Mathematics and Natural Sciences ( Memento of the original from March 6, 2014 in the Internet Archive ) Info: The archive link was automatically inserted and not yet checked. Please check the original and archive link according to the instructions and then remove this notice. tu-dresden.de  @1@ 2Template: Webachiv / IABot / tu-dresden.de