POLYNOMIAL-TIME SOLVABILITY OF THE COLORING PROBLEM IN SOME GRAPH CLASS |
| 4 | |
| 2014 |
| scientific article | 519.17 | ||
| 288-290 | coloring problem, hereditary class, polynomial-time algorithm |
| The coloring problem is shown to be polynomial-time solvable for the graph class Free ({ claw , bull }) . |
 |