The following pages link to \(T\)-choosability in graphs (Q1383364):
Displaying 15 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)
- Some results on list \(T\)-colourings (Q1377778) (← links)
- Generalized list \(T\)-colorings of cycles (Q1775057) (← links)
- An algebraic criterion for the choosability of graphs (Q2345516) (← links)
- Choosability of graphs with infinite sets of forbidden differences (Q2462372) (← links)
- Some new bounds on \(T_{r}\)-choosability (Q2643324) (← links)
- (\(1,\lambda\))-embedded graphs and the acyclic edge choosability (Q2890349) (← links)
- (Q2931498) (← links)
- (Q2936690) (← links)
- Circular choosability (Q3652533) (← links)
- On the acyclic choosability of graphs (Q5469027) (← links)
- (Q5741893) (← links)
- On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs (Q6117322) (← links)
