Covering Graphs with Few Complete Bipartite Subgraphs

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

doi:10.1007/978-3-540-77050-3_28

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 SzeiderFSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings (Vikraman Arvind, Sanjiva Prasad, eds.), volume 4855 of Lecture Notes in Computer Science, pages 340-351, 2007, Springer Verlag.

Bibtex Entry:

@string{lncs="Lecture Notes in Computer Science"}
@string{springer="Springer Verlag"}
@inproceedings{FleischnerMujuniPaulusmaSzeider07,
  author    = {Herbert Fleischner and
               Egbert Mujuni and
               Dani{\"{e}}l Paulusma and
               Stefan Szeider},
  title     = {Covering Graphs with Few Complete Bipartite Subgraphs},
  booktitle = {{FSTTCS} 2007: Foundations of Software Technology and Theoretical
               Computer Science, 27th International Conference, New Delhi, India,
               December 12-14, 2007, Proceedings},
  pages     = {340-351},
  doi       = {10.1007/978-3-540-77050-3_28},
  editor    = {Vikraman Arvind and
               Sanjiva Prasad},
  series    = LNCS,
  volume    = {4855},
  publisher = Springer,
  year      = {2007},
  isbn      = {978-3-540-77049-7},
}