Výsledky vyhledávání - "Polytime dynamic programming algorithms"

b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs Autor Bonomo, Flavia, Schaudt, Oliver, Stein, Maya, Valencia-Pabon, Mario

“…A b-coloring of a graph is a proper coloring such that every color class contains a vertex that is adjacent to all other color classes. The b-chromatic number…”
Získat plný text