Covering graphs with few complete bipartite subgraphs

Fleischner, Herbert; Mujuni, Egbert; Paulusma, Daniël; Szeider, Stefan

doi:10.1016/j.tcs.2008.12.059

by Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider

Reference:

Covering graphs with few complete bipartite subgraphsHerbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan SzeiderTheoretical Computer Science, volume 410, number 21-23, pages 2045-2053, 2009.

Bibtex Entry:

@string{tcs="Theoretical Computer Science"}
@article{FleischnerMujuniPaulusmaSzeider09,
  author    = {Herbert Fleischner and
               Egbert Mujuni and
               Dani{\"{e}}l Paulusma and
               Stefan Szeider},
  title     = {Covering graphs with few complete bipartite subgraphs},
  journal   = TCS,
  volume    = {410},
  number    = {21-23},
  pages     = {2045-2053},
  year      = {2009},
  doi       = {10.1016/j.tcs.2008.12.059},
   url   = {https://www.ac.tuwien.ac.at/files/pub/FleischnerMujuniPaulusmaSzeider09.pdf},
}