Let G be a graph and H a subgraph of G. A backbone‐k‐coloring of (G,H) is a mapping f: V(G)→{1,2,…,k} such that |f(u)-f(v)|≥2 if uv∈E(H) and |f(u)-f(v)|≥1 if uv∈E(G)\E(H). The backbone chromatic number of (G,H) is the smallest integer k such that (G,H) has a backbone‐k‐coloring. In this paper, we characterize the backbone chromatic number of Halin graphs G=T∪C with respect to given spanning trees T. Also we study the backbone coloring for other special graphs such as complete graphs, wheels, graphs with small maximum average degree, graphs with maximum degree 3, etc.
