The main purpose of the present paper is to investigate the edge chromatic number X′(G) and the total chromatic number X_T(G) of double outerplanar graph withΔ(G)≥6.

The degree-constrained k-arboricity of outerplanar graphs;

The vertex arboricity of the square of an outerplanar graph;

In this paper,we study the undirected minimum-cardinality feedback vertex set problem in outerplanar graphs and present a polynomial time algorithm to solve it.

In thispaper, we study the minimum-weight feedback vertex set problem in outerplanar graphs and present a linear time algorithm to solve it.

In this paper we prove that the problem is polynomial solvable on several special classes of graphs, such as outerplanar graphs, series-parallel graphs and Eulerian planar graphs.

In this paper,we have proved that if G is an outerplane graph without any cut vertex and Δ (G) ≥6, then x ef l(G)= Δ (G) .

The structural properties of outerplane graphs was studied.

This paper disussed some special planar graph and outerplane graph s vexter,edge,face relationg with the Euler s formul

Adjacent-vertex-distinguishing total chromatic number on 2-connected outer plane graph with△(G)≤4;

Adjacent-vertex-distinguishing total chromatic number on 2-conected outer plane graph with Δ(G)=5;

Adjacent vertex distinguishing total coloring on 2-connected outer plane graph