\(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs (Q747619)
From MaRDI portal
(Redirected from Item:Q3195320)
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: \(b\)-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs |
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
0.9962116479873656
0 references
0.8502357006072998
0 references
0.8309000134468079
0 references
0.8274885416030884
0 references
0.823047399520874
0 references
