\((4m,m)\)-choosability of plane graphs
From MaRDI portal
Publication:5943679
zbMath0984.05038MaRDI QIDQ5943679
Publication date: 7 May 2002
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Related Items
Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable, On 3-choosability of plane graphs without 6-, 7- and 9-cycles, On 3-choosability of planar graphs without certain cycles