On r-hued list coloring of K₄ ( 7 )-minor free graphs
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.\)
- Coloring the square of a \(K_{4}\)-minor free graph
- Conditional colorings of graphs
- Decomposition and r-hued coloring of K₄(7)-minor free graphs
- Dynamic coloring and list dynamic coloring of planar graphs
- Dynamic coloring parameters for graphs with given genus
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Graph \(r\)-hued colorings -- a survey
- Graph theory
- scientific article; zbMATH DE number 2197944 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- List-colouring the square of a \(K_4\)-minor-free graph
- On r-hued coloring of K₄-minor free graphs
- On \(r\)-hued coloring of planar graphs with girth at least 6
- On dynamic coloring for planar graphs and graphs of higher genus
- On the list dynamic coloring of graphs
- The four-colour theorem
- Upper bounds of r-hued colorings of planar graphs
- On list \(r\)-hued coloring of outer-1-planar graphs
- Graph \(r\)-hued colorings -- a survey
- Decomposition and r-hued coloring of K₄(7)-minor free graphs
- On r-hued coloring of K₄-minor free graphs
- Linear list \(r\)-hued coloring of \(K_4\)-minor free graphs.
- List 3-dynamic colorings of planar graphs
- The list r-hued coloring of Halin graph
- The r-hued coloring of K₄ (7)-minor free graphs
- 3-IC planar graphs are dynamically 9-choosable
This page was built for publication: On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2065804)
