\(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (Q747619): Difference between revisions
From MaRDI portal
Changed an Item |
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
||
| description / en | description / en | ||
Revision as of 15:34, 29 April 2024
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs |
No description defined |
Statements
\(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (English)
0 references
19 October 2015
0 references
\(b\)-coloring
0 references
stability number two
0 references
co-triangle-free graphs
0 references
NP-hardness
0 references
tree cographs
0 references
polytime dynamic programming algorithms
0 references
