SIMPLICIAL TREE-DECOMPOSITIONS OF INFINITE-GRAPHS .1.

被引：5
|
作者：
DIESTEL, R
机构：
[1] Department of Pure Mathematics, University of Cambridge, Cambridge, England
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES B | 1990年 / 48卷 / 02期
关键词：
D O I：
10.1016/0095-8956(90)90118-J
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
This paper is intended as an introduction to the theory of simplicial decompositions of graphs. It presents, in a unified way, new results as well as some basic old ones (with new proofs). Its main result is a structure theorem for infinite graphs with simplicial tree-decompositions into primes. The existence and uniqueness of such prime decompositions will be investigated in two subsequent papers. © 1990.
引用
收藏
页码：197 / 215
页数：19
相关论文
共 50 条
12345