On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs (Q2065804)

For a given list assignment \(L\) of a graph \(G\), an \((L,r)\)-coloring of \(G\) is a proper coloring \(c\) such that for any vertex \(v\) with degree \(d(v)\), \(v\) is adjacent to vertices of at least \(\min\{d(v),r\}\) different color with \(c(v)\in L(v)\). The \(r\)-hued list chromatic number of \(G\), denoted as \(\chi_{L,r(G)}\), is the least integer \(k\), such that for any \(v\in (G)\) and every list assignment \(L\) with \(|L(v)|=k\), \(G\) has an \((L,r)\)-coloring. Let \(K(r)=r+3\) if \(2\leq r\leq 3\), \(K(r)= \lfloor 3r/2\rfloor +1 \) if $r\geq 4$. \textit{H. Song} et al. [Discrete Math. 315--316, 47--52 (2014; Zbl 1278.05109)] proved that if \(G\) is a \(K_4\)-minor free graph, then \(\chi_{L,r}(G)\leq K(r)+1\). Let \(K_4(n)\) be the set of all subdivisions of \(K_4\) on \(n\) vertices. Utilizing the decompositions by \textit{Y. Chen} et al. [Appl. Math. Comput. 384, Article ID 125206, 11 p. (2020; Zbl 07212653)] for \(K_4(7)\)-minor free graphs, the authors prove that if \(G\) is a \(K_4(7)\)-minor free graph, then \(\chi_{L,r(G)}\leq K(r)+1.\)