摘要
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that each 1-planar graph with maximum degree △ is （A ＋ 1）-edge-choosable and （△ ＋ 2）- total-choosable if △ ≥ 16, and is A-edge-choosable and （△ ＋ 1）-total-ehoosable if △ ≥21. The second conclusion confirms the list coloring conjecture for the class of 1-planar graphs with large maximum degree.
A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that each 1-planar graph with maximum degree △ is （A ＋ 1）-edge-choosable and （△ ＋ 2）- total-choosable if △ ≥ 16, and is A-edge-choosable and （△ ＋ 1）-total-ehoosable if △ ≥21. The second conclusion confirms the list coloring conjecture for the class of 1-planar graphs with large maximum degree.
