论文部分内容阅读
In this paper, the choosability of outerplanar graphs, 1-tree and strong 1-outerplanargraphs have been described completely. A precise upper bound of the list chromatic number of 1-outerplanar graphs is given, and that every 1-outerplanar graph with girth