2-connected chordal graphs and line graphs are \((1,5)\)-choosable

DOI10.1016/j.ejc.2020.103227zbMath1458.05128OpenAlexW3082355831MaRDI QIDQ2225433

Tsai-Lien Wong

Publication date: 8 February 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2020.103227

zbMATH Keywords

line graphsAlon-Tarsi number

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (3)

On a list variant of the multiplicative 1-2-3 conjecture ⋮ Dense Eulerian graphs are \((1, 3)\)-choosable ⋮ Every nice graph is (1,5)-choosable

Cites Work

• Every graph is \((2,3)\)-choosable
• A nowhere-zero point in linear mappings
• Colorings and orientations of graphs
• Graphs are \((1, \varDelta + 1)\)-choosable
• Weight choosability of graphs
• Combinatorial Nullstellensatz
• Total weight choosability of graphs
• Total weight choosability of graphs

This page was built for publication: 2-connected chordal graphs and line graphs are \((1,5)\)-choosable