Please use this identifier to cite or link to this item:
Title: Zur Komplexität von Reduzierbarkeitsproblemen über H-Comparabilitygraphen
Author(s): Andresen, Michael
Referee(s): Bräsel, Heidemarie
Granting Institution: Otto-von-Guericke-Universität Magdeburg
Issue Date: 2009
Extent: Online-Ressource (PDF-Datei: 194 S., 2578 KB)
Type: Hochschulschrift
Type: Doctoral Thesis
Language: German
Publisher: Universitätsbibliothek
Otto von Guericke University Library, Magdeburg, Germany
URN: urn:nbn:de:101:1-201012104588
Subjects: Graphentheorie
Open Access: Open access publication
Appears in Collections:Fakultät für Mathematik

Files in This Item:
File Description SizeFormat 
Dissertation_(Michael_Andresen).PDF2.58 MBAdobe PDFThumbnail

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.