Almost all Berge graphs are perfect
Year of publication: |
1991
|
---|---|
Authors: | Prömel, Hans Jürgen ; Steger, Angelika |
Institutions: | Institut für Ökonometrie und Operations Research, Rheinische Friedrich-Wilhelms-Universität Bonn (contributor) ; Deutsche Forschungsgemeinschaft (contributor) |
Publisher: |
Bonn : Forschungsinst. für Diskrete Mathematik [u.a.] |
Subject: | Graphentheorie | Graph theory | Mathematische Optimierung | Mathematical programming | USA | United States | Theorie | Theory |
Extent: | 33 S. |
---|---|
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 |
-
A supernodal formulation of vertex colouring with applications in course timetabling
Burke, Edmund K., (2010)
-
A simpler characterization of a spectral lower bound on the clique number
Yıldırım, E. Alper, (2010)
-
Solving shortest path problems with a weight constraint and replenishment arcs
Smith, Olivia J., (2012)
- More ...
-
The asymptotic structure of H-free graphs
Prömel, Hans Jürgen, (1991)
-
Prömel, Hans Jürgen, (1989)
-
The asymptotic number of graphs not containing a fixed color-critical subgraph
Prömel, Hans Jürgen, (1989)
- More ...