基本信息
浏览量:5
职业迁徙
个人简介
Fleischner’s research focuses mainly on graph theoretical topics such as hamiltonian and eulerian graphs. One of his main achievements is the proof of the theorem according to which the square of every two-connected graph has a Hamiltonian cycle. This result (now known as Fleischner's theorem) had been submitted in 1971 and was published in 1974.
Another milestone in his research was the solution of the „Cycle plus Triangles Problems“ posed by Paul Erdős; its solution came about in cooperation with Michael Stiebitz (TU Ilmenau).
Fleischner published more than 90 papers in various mathematical journals; his Erdős-number is 2. His friendship with the Austrian painter de:Robert Lettner resulted in a cooperation in which certain graphs were transformed into paintings called mutations.
During 2002-2007 he was Chairman of the Committee for Developing Countries of the European Mathematical Society (EMS-CDC).
Another milestone in his research was the solution of the „Cycle plus Triangles Problems“ posed by Paul Erdős; its solution came about in cooperation with Michael Stiebitz (TU Ilmenau).
Fleischner published more than 90 papers in various mathematical journals; his Erdős-number is 2. His friendship with the Austrian painter de:Robert Lettner resulted in a cooperation in which certain graphs were transformed into paintings called mutations.
During 2002-2007 he was Chairman of the Committee for Developing Countries of the European Mathematical Society (EMS-CDC).
研究兴趣
论文共 28 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science: 27th International Conference, New Delhi, India, December 12-14, 2007. Proceedingspp.340-351, (2023)
引用21浏览0EI引用
21
0
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn