"b-coloring is NP-hard on co-bipartite graphs and polytime solvable on ..."

Flavia Bonomo et al. (2013)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2018-08-13

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/BonomoSSV13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/BonomoSSV13
Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon:
b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs. CoRR abs/1310.8313 (2013)

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.