Some new bounds on \(T_{r}\)-choosability
From MaRDI portal
Publication:2643324
DOI10.1016/j.disc.2006.09.043zbMath1125.05044OpenAlexW2082561946MaRDI QIDQ2643324
Publication date: 23 August 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.09.043
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A short proof of a conjecture on the \(T_r\)-choice number of even cycles
- List \(T\)-colorings of graphs
- \(T\)-choosability in graphs
- On the span in channel assignment problems: Bounds, computing and counting
- A Theorem about the Channel Assignment Problem
- A Brooks-Type Theorem for the Generalized List T-Coloring