POINT-ARBORICITY OF A GRAPH

被引：126

作者：

CHARTRAND, G

KRONK, HV

WALL, CE

机构：

来源：

ISRAEL JOURNAL OF MATHEMATICS | 1968年 / 6卷 / 02期

关键词：

D O I：

10.1007/BF02760181

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The point-arboricity ρ(G) of a graph G is defined as the minimum number of subsets in a partition of the point set of G so that each subset induces an acyclic subgraph. Dually, the tuleity τ(G) is the maximum number of disjoint, point-induced, non-acyclic subgraphs contained in G. Several results concerning these numbers are presented, among which are formulas for the point arboricity and tulgeity of the class of complete n-partite graphs. © 1968 Hebrew University.

引用

页码：169 / +

页数：1