Covering graphs with few complete bipartite subgraphs

Herbert Fleischner, Egbert Mujuni, Dani{\"{e}}l Paulusma, Stefan Szeider
January 2009
PDF bib DOI

Abstract

Full Citation:

Herbert Fleischner, Egbert Mujuni, Dani"el Paulusma, Stefan Szeider. Covering graphs with few complete bipartite subgraphs. Theoretical Computer Science, volume 410, number 21-23, pages 2045-2053, 2009.

Type
Journal Article
Stefan Szeider
Stefan Szeider
Head of Research Unit

Stefan Szeider is a Professor at the Algorithms and Complexity Group.