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 c
Given a complete graph with vertex set X and subsets X1,X2,...,Xn, the problem of finding a subgraph G with minimum number of edges such that for every i= 1, 2,