On the complexity of some packing and covering problems in certain graph classes

2012-12-20 14:00-15:00 Famnit-Semin (Seminar room) Prof. Andreas Brandstädt (University of Rostock, Germany) On the complexity of some packing and covering problems in certain graph classes Packing and covering problems in graphs and hypergraphs and their relationships belong to the…


