论文信息 - Maximum Induced Linear Forests in Outerplanar Graphs - 字舞流文

Maximum Induced Linear Forests in Outerplanar Graphs

Abstract.Every simple n–vertex outerplanar graph has an induced subgraph with at least vertices that is a linear forest, and this bound is sharp.

Michael J. Pelsmajer

[1] Michael O. Albertson,et al. A lower bound for the independence number of a planar graph , 1976 .

[2] Izak Broere,et al. Generalized colorings of outerplanar and planar graphs , 1985 .

[3] K. S. Poh. On the linear vertex-arboricity of a planar graph , 1990, J. Graph Theory.

[4] Jin Akiyama,et al. Path chromatic numbers of graphs , 1989, J. Graph Theory.

[5] Kiyoshi Hosono,et al. Induced Forests in Trees and Outerplanar Graphs , 1990 .

[6] Jin Akiyama,et al. Maximum induced forests of planar graphs , 1987, Graphs Comb..