b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs (Q3195320): Difference between revisions
From MaRDI portal
Item:Q3195320
Changed an Item |
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
||
| description / en | description / en | ||
scientific article | scientific article; zbMATH DE number 6495546 | ||
Revision as of 15:34, 29 April 2024
scientific article; zbMATH DE number 6495546
| 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
16 October 2015
0 references
\(b\)-chromatic number of graphs with stability number two
0 references
polynomial time dynamic programming algorithm
0 references
