Some results on list T-colourings
Let \(T\) be a set of non-negative integers. Then a \(T\)-colouring of \(G\) is a function, \(\varphi(n): V(G)\to\mathbb{N}\), which assigns to each vertex of \(G\) a positive integer such that if \(u\nu\) is an edge of \(G\) then \(|\varphi (u)- \varphi(v) | \notin T\). Assign to each vertex \(v\in V(G)\) a list \(L(v)\) of \(k\) distinct positive integers. If we can always choose a \(T\)-colouring, \(\varphi\), of \(G\) such that \(\varphi (v)\in L(v)\) for every vertex \(v\) in \(G\), whatever the lists were chosen, then \(G\) is said to be \(k\)-choosable. The \(T\)-choice number of \(G\) is the least value of \(k\) for which \(G\) is \(k-T\)-choosable. In the paper a lower bound for the \(T\)-choice number of even cycles with the set \(T=\{0,1,2, \dots,r\}\), \(r\geq 1\), is obtained. The exact values of the \(T\)-choice numbers for the even cycles \(C_4\) and \(C_{2n}\), \(n\geq r\), are given as well.
- A short proof of a conjecture on the \(T_r\)-choice number of even cycles
- List T-colorings of graphs
- \(T\)-choosability in graphs
- Choosability of graphs with infinite sets of forbidden differences
- Some new bounds on \(T_{r}\)-choosability
- scientific article; zbMATH DE number 6000769 (Why is no real title available?)
- An Upper Bound for List T -Colourings
This page was built for publication: Some results on list \(T\)-colourings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377778)
