On λ-backbone coloring of cliques with tree backbones in linear time

Krzysztof Michalik, Krzysztof Turowski

A $\hat{I}»$-backbone coloring of a graph $G$ with its subgraph (also called a backbone) $H$ is a function $c:V(G)\to \{1,\dots ,k\}$ ensuring that $c$ is a proper colori…