2-Coupon Coloring of Cubic Graphs Containing 3-Cycle or 4-Cycle

S. Akbari, M. Azimian, A. Fazli Khani +2

Let $G$ be a graph. A total dominating set in a graph $G$ is a set $S$ of vertices of $G$ such that every vertex in $G$ is adjacent to a vertex in $S$. Recently, the following ques…