Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable
From MaRDI portal
Publication:1043786
DOI10.1007/S00373-008-0817-5zbMath1221.05133arXiv1308.3038OpenAlexW2069022115MaRDI QIDQ1043786
Publication date: 9 December 2009
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.3038
Cites Work
This page was built for publication: Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable