ANOTHER PROOF OF A THEOREM CONCERNING DETACHMENTS OF GRAPHS

被引：3

作者：

NASHWILLIAMS, CSJA ^{[1
]}

机构：

[1] UNIV READING,READING RG6 2AX,ENGLAND

来源：

EUROPEAN JOURNAL OF COMBINATORICS | 1991年 / 12卷 / 03期

关键词：

D O I：

10.1016/S0195-6698(13)80090-X

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let b be a positive integer-valued function on the set of vertices of a finite graph G. We give a new proof of a theorem which characterizes the least possible number of components of a graph obtainable from G by splitting each vertex ξ into b(ξ) vertices. © 1991, Academic Press Limited. All rights reserved.

引用

页码：245 / 247

页数：3