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

DOI10.1016/J.EJC.2020.103227MaRDI QIDQ2225433zbMATH OpenOpenAlexFDO

Authors 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

Alon-Tarsi numberline graphs

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Graphs are \((1, \varDelta + 1)\)-choosable
• (2,t)-choosable graphs
• Graphs with two crossings are 5-choosable
• Edge choosability of planar graphs without 5-cycles with a chord
• Choosability of P 5-Free Graphs
• Every nice graph is (1,5)-choosable
• Choosability and edge choosability of planar graphs without five cycles
• scientific article; zbMATH DE number 908794
• Every graph is (2,3)-choosable
• Plane graphs are entirely ( + 5)-choosable

Cites work

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

Cited in

(4)

• Graphs are \((1, \varDelta + 1)\)-choosable
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225433)