L(2,1)-labelling number of 2-outer planar graphs

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

This paper investigated the cycle base structures of 2-connected outerplanar graphs on the torus and proved that there is a one-to-one correspondence between the minimal cycle base and two nonhomotopic noncontractible cycles with the shortest total length when fw(G)≥2 and ew(G) > m, m = max{li | 1≤i≤f}(l1,…,lf denote the length of all the non-Hamilton facial walks of G).

In this paper,we investigate the cycle bases structure of 2-connected outerplanar graphs on the plane and the projective plane in the case of ew(G)≥5.

In this paper, we investigate cycle base structures of 2-connected graphs on the projective plane and determine the minimum cycle base structure of 2-connected outerplanar graphs in the case of ew(G)≥5.