\(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (Q747619): Difference between revisions
From MaRDI portal
Latest revision as of 22:43, 10 July 2024
scientific article; zbMATH DE number 6495546
- b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs |
scientific article; zbMATH DE number 6495546 |
|
Statements
\(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (English)
0 references
b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs (English)
0 references
19 October 2015
0 references
16 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
\(b\)-chromatic number of graphs with stability number two
0 references
polynomial time dynamic programming algorithm
0 references
