On the complexity of recognizing perfectly orderable graphs
Year of publication: |
1989
|
---|---|
Authors: | Middendorf, M. ; Pfeiffer, Frank |
Publisher: |
Bonn : Forschungsinst. für Diskrete Mathematik |
Subject: | Graphentheorie | Graph theory |
Extent: | 7 S. graph. Darst. |
---|---|
Series: | Report. - Bonn : Univ., ISSN 0724-3138, ZDB-ID 1019256-6. |
Type of publication: | Book / Working Paper |
Language: | English |
Source: | ECONIS - Online Catalogue of the ZBW |
-
Connectedness between G10 currencies : searching for the causal structure
Bettendorf, Timo, (2023)
-
Cheng, Ying, (2023)
-
Exploratory analysis of grocery product networks
Hsieh, Ping-hung, (2022)
- More ...
-
On the complexity of the disjoint path problem
Middendorf, M., (1989)
-
Routing multiterminal nets via disjoint connected t-joins
Middendorf, M., (1988)
-
The max clique problem in classes of string-graphs
Middendorf, M., (1988)
- More ...