b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs

Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon
Algorithmica, Volume 73, Number 2, page 289--305 - 2015
Download the publication : b-col_Algorithmica.pdf [318Ko]  

BibTex references

@Article\{BSSV15,
  author       = "Bonomo, Flavia and Schaudt, Oliver and Stein, Maya and Valencia-Pabon, Mario",
  title        = "b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs",
  journal      = "Algorithmica",
  number       = "2",
  volume       = "73",
  pages        = "289--305",
  year         = "2015",
  publisher    = "Springer",
  url          = "http://publicaciones.dc.uba.ar/Publications/2015/BSSV15"
}

Other publications in the database

» Flavia Bonomo
» Oliver Schaudt
» Maya Stein
» Mario Valencia-Pabon