Home

con ember connect törött ingo schiermeyer Jelenlegi Déli Románc

Ingo Schiermeyer – Professor – TU Bergakademie Freiberg | LinkedIn
Ingo Schiermeyer – Professor – TU Bergakademie Freiberg | LinkedIn

Ingo SCHIERMEYER | Chair for Applied Discrete Mathematics | Prof. Dr. rer.  nat. habil. | Technische Universität Bergakademie Freiberg, Freiberg |  Institute of Discrete Mathematics and Algebra | Research profile
Ingo SCHIERMEYER | Chair for Applied Discrete Mathematics | Prof. Dr. rer. nat. habil. | Technische Universität Bergakademie Freiberg, Freiberg | Institute of Discrete Mathematics and Algebra | Research profile

Monday 9.00: opening 9.15-10.15: Sophie Spirkl: 4-Coloring P6-free graphs  10.15-10.45: coffee/tea break 10.45-12.00: Paul
Monday 9.00: opening 9.15-10.15: Sophie Spirkl: 4-Coloring P6-free graphs 10.15-10.45: coffee/tea break 10.45-12.00: Paul

Schiermeyer in der Personensuche von Das Telefonbuch
Schiermeyer in der Personensuche von Das Telefonbuch

Service & Kontakt
Service & Kontakt

Norbert Neuser - Superteam for Africa Together We Can Großer Erfolg für die  Afrika-Woche unserer S-D-Fraktion in Brüssel und mit den  "Go-Local-Veranstaltungen" in Brüssel, Rom und Mainz - machbar nur mit einem
Norbert Neuser - Superteam for Africa Together We Can Großer Erfolg für die Afrika-Woche unserer S-D-Fraktion in Brüssel und mit den "Go-Local-Veranstaltungen" in Brüssel, Rom und Mainz - machbar nur mit einem

Details: Klaus Jansen, Derek G. Corneil, Ingo Schiermeyer
Details: Klaus Jansen, Derek G. Corneil, Ingo Schiermeyer

ON THE COMPUTATIONAL COMPLEXITY OF (O, P)-PARTITION PROBLEMS
ON THE COMPUTATIONAL COMPLEXITY OF (O, P)-PARTITION PROBLEMS

On minimally rainbow k-connected graphs
On minimally rainbow k-connected graphs

On the chromatic number of (P_{5},windmill)-free graphs
On the chromatic number of (P_{5},windmill)-free graphs

PROPER RAINBOW CONNECTION NUMBER OF GRAPHS
PROPER RAINBOW CONNECTION NUMBER OF GRAPHS

ON MAXIMUM WEIGHT OF A BIPARTITE GRAPH OF GIVEN ORDER AND SIZE 1
ON MAXIMUM WEIGHT OF A BIPARTITE GRAPH OF GIVEN ORDER AND SIZE 1

PDF) The independence number in graphs of maximum degree three | Michael  Henning and Ingo Schiermeyer - Academia.edu
PDF) The independence number in graphs of maximum degree three | Michael Henning and Ingo Schiermeyer - Academia.edu

PDF) Graphs with 3-rainbow index n-1 and n-2 | Ingo Schiermeyer -  Academia.edu
PDF) Graphs with 3-rainbow index n-1 and n-2 | Ingo Schiermeyer - Academia.edu

Schiermeyer in der Personensuche von Das Telefonbuch
Schiermeyer in der Personensuche von Das Telefonbuch

4-colorability of P6-free graphs ⋆
4-colorability of P6-free graphs ⋆

PDF) Extending the MAX Algorithm for Maximum Independent Set
PDF) Extending the MAX Algorithm for Maximum Independent Set

Mini Workshop về Tổ hợp, Lý thuyết Đồ thị và Ứng dụng - Viện nghiên cứu cao  cấp về toán
Mini Workshop về Tổ hợp, Lý thuyết Đồ thị và Ứng dụng - Viện nghiên cứu cao cấp về toán

Rainbow Connection in Graphs with Minimum Degree Three
Rainbow Connection in Graphs with Minimum Degree Three

Details: Klaus Jansen, Friedhelm Meyer auf der Heide, Ingo Schiermeyer
Details: Klaus Jansen, Friedhelm Meyer auf der Heide, Ingo Schiermeyer

Random Procedures for Dominating Sets in Graphs
Random Procedures for Dominating Sets in Graphs

Mathematisches Forschungsinstitut Oberwolfach Algorithmic Graph Theory
Mathematisches Forschungsinstitut Oberwolfach Algorithmic Graph Theory

arXiv:1709.02475v1 [math.CO] 7 Sep 2017
arXiv:1709.02475v1 [math.CO] 7 Sep 2017

Details: Ingo Schiermeyer
Details: Ingo Schiermeyer

References
References

Institut für Diskrete Mathematik und Algebra - TU Bergakademie Freiberg
Institut für Diskrete Mathematik und Algebra - TU Bergakademie Freiberg