Hits :

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 1997-01-01

Document Type : 期刊

Journal : Applied Mathematics-A Journal of Chinese Universities

Volume: Vol.12

Issue : No.4

Page Number : 455-462

ISSN : 1005-1031

Translation or Not : no

Key Words : Total;chromatic;number;planar;graph

Abstract : A planar graph G is called a (-pseudo-outerplanar graph if there is a subset V o  ⊆ V(G), |V o | = i, such that G-V   o   is an outerplanar graph. In particular, when G-V   o   is a forest. G is called a:i-pseudo-tree. In this paper, the following results