b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs (Q3195320): Difference between revisions
From MaRDI portal
Item:Q3195320
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2104061284 / rank | |||
Normal rank | |||
Revision as of 20:29, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs |
scientific article |
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
