On computing the minimum 3-path vertex cover and dissociation number of graphs
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
ON MAXIMUM WEIGHT OF A BIPARTITE GRAPH OF GIVEN ORDER AND SIZE 1
Details: Klaus Jansen, Friedhelm Meyer auf der Heide, Ingo Schiermeyer
PDF) Graphs with 3-rainbow index n-1 and n-2 | Ingo Schiermeyer - Academia.edu
GRAPHS WITH 3-RAINBOW INDEX n − 1 AND n − 2
Details: Klaus Jansen, Derek G. Corneil, Ingo Schiermeyer
Rainbow Connection in Graphs with Minimum Degree Three
ON THE COMPUTATIONAL COMPLEXITY OF (O, P)-PARTITION PROBLEMS
Random Procedures for Dominating Sets in Graphs
arXiv:1709.02475v1 [math.CO] 7 Sep 2017
On the chromatic number of (P5, K2,t)-free graphs
On the minimum rainbow subgraph number of a graph Ingo Schiermeyer Abstract We consider the Minimum Rainbow Subgraph problem (MR
Details: Ingo Schiermeyer
Schiermeyer in der Personensuche von Das Telefonbuch
Mathematisches Forschungsinstitut Oberwolfach Algorithmic Graph Theory
PDF) Extending the MAX Algorithm for Maximum Independent Set
Institut für Diskrete Mathematik und Algebra - TU Bergakademie Freiberg
On minimally rainbow k-connected graphs
Service & Kontakt
Proper Connection Number of Graphs
View > News & Events > News & Events > Applied Mathematics and Statistics
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
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
