Bipartite Graphs whose Squares are not Chromatic-Choosable

[摘要] The square $G^2$ of a graph $G$ is the graph defined on $V(G)$ such that two vertices $u$ and $v$ are adjacent in $G^2$ if the distance between $u$ and $v$ in $G$ is at most 2. Let $\chi(H)$ and $\chi_{\ell}(H)$ be the chromatic number and the list chroma

[学科分类] 离散数学和组合数学

[关键词] Square of graph;Chromatic-choosable;List chromatic number