"b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on ..."

Flavia Bonomo et al. (2015)

> Home

Details and statistics

DOI: 10.1007/S00453-014-9921-5

access: closed

type: Journal Article

metadata version: 2020-09-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BonomoSSV15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BonomoSSV15
Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon:
b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs. Algorithmica 73(2): 289-305 (2015)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.