5-交叉点相距很远的图的可选性
5-choosability of graphs with crossings far apart
摘要：
给出了可平面图是5-可选图的一个新的证明，并利用它证明了在平面上画出的每对交叉点之间的距离至少为15的图是5-可选图.同时，我们可以允许某些顶点只有大小为4的列表，只要它们相距很远并且远离交叉点。
英文摘要：
We give a new proof of the fact that every planar graph is 5-choosable, and use it to show that every graph drawn in the plane so that the distance between every pair of crossings is at least 15 is 5-choosable. At the same time we may allow some vertices to have lists of size four only, as long as they are far apart and far from the crossings.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
