b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (Extended abstract)

Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon
Lecture Notes in Computer Science, Volume 8596, page 100--111 - 2014
Download the publication : iscov2.pdf [321Ko]  

BibTex references

@Article\{BSSV14,
  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 (Extended abstract)",
  journal      = "Lecture Notes in Computer Science",
  volume       = "8596",
  pages        = "100--111",
  year         = "2014",
  note         = "Proc. ISCO 2014",
  url          = "http://publicaciones.dc.uba.ar/Publications/2014/BSSV14"
}

Other publications in the database

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