Wen-Jie Hu

Partitioning an $S$-packing coloring into broadcast dominating sets

Given a graph $G$ and a positive integer $k$, a packing $k$-domatic coloring of $G$ is a function $f: V(G) \to \{1,\ldots,t\}$ such that (1) for any color $j \in \{1,\ldots, t\}$ and any two distinct vertices $u,v\in V(G)$ with $f(u)=f(v)=j$ we have $d_G(u,v)>j$, and (2) $V(G)$ admits a partition into $k$ sets $A_1,\ld...