On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs
type: Item
instance of: scholarly article
title: On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs
zbMATH Open document ID: 1490.05088
author: Wenjuan Wei
author: Fengxia Liu
author: Wei Xiong
author: Hong-Jian Lai
published in: Discrete Applied Mathematics
publication date: 2022-01-13T00:00:00Z
review text: 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.\)
reviewed by: Bo Ning
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C83
zbMATH DE Number: 7456402
zbMATH Keywords: \(r\)-hued list chromatic number
zbMATH Keywords: graph minor
MaRDI profile type: MaRDI publication profile
full work available at URL: j.dam.2021.12.013
OpenAlex ID: W4206017483
cites work: On the list dynamic coloring of graphs
cites work: Every planar map is four colorable. I: Discharging
cites work: Every planar map is four colorable. II: Reducibility
cites work: Q5422499
cites work: Q5782525
cites work: On dynamic coloring for planar graphs and graphs of higher genus
cites work: Decomposition and \(r\)-hued coloring of \(K_4(7)\)-minor free graphs
cites work: Graph \(r\)-hued colorings -- a survey
cites work: List-colouring the square of a \(K_4\)-minor-free graph
cites work: Dynamic coloring and list dynamic coloring of planar graphs
cites work: Conditional colorings of graphs
cites work: Q5466088
cites work: Coloring the square of a \(K_{4}\)-minor free graph
cites work: Dynamic coloring parameters for graphs with given genus
cites work: The four-colour theorem
cites work: On \(r\)-hued coloring of \(K_4\)-minor free graphs
cites work: Upper bounds of \(r\)-hued colorings of planar graphs
cites work: On \(r\)-hued coloring of planar graphs with girth at least 6
DOI: 10.1016/J.DAM.2021.12.013
description: scientific article; zbMATH DE number 7456402