\(T\)-choosability in graphs

DOI10.1016/S0166-218X(97)00124-8zbMath0890.05026OpenAlexW2114919740MaRDI QIDQ1383364

Ayal Zaks, Noga Alon

Publication date: 18 June 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

complete bipartite graphvertex coloringeven cycle\(T\)-choice number\(S\)-list \(T\)-coloring\(T\)-choosability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Some new bounds on \(T_{r}\)-choosability ⋮ On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs ⋮ On two generalizations of the Alon-Tarsi polynomial method ⋮ Choosability of graphs with infinite sets of forbidden differences ⋮ Generalized list \(T\)-colorings of cycles ⋮ Circular choosability ⋮ A short proof of a conjecture on the \(T_r\)-choice number of even cycles ⋮ List version of \(L(d,s)\)-labelings

Cites Work

• \(T\)-colorings of graphs: recent results and open problems
• Colorings and orientations of graphs
• Consistency in networks of relations
• List \(T\)-colorings of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(T\)-choosability in graphs