The following pages link to \(T\)-choosability in graphs (Q1383364):
Displaying 8 items.
- On two generalizations of the Alon-Tarsi polynomial method (Q651032) (← links)
- List version of \(L(d,s)\)-labelings (Q817777) (← links)
- A short proof of a conjecture on the \(T_r\)-choice number of even cycles (Q1304486) (← links)
- Generalized list \(T\)-colorings of cycles (Q1775057) (← links)
- Choosability of graphs with infinite sets of forbidden differences (Q2462372) (← links)
- Some new bounds on \(T_{r}\)-choosability (Q2643324) (← links)
- Circular choosability (Q3652533) (← links)
- On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs (Q6117322) (← links)
