共 50 条
Dividing a graph by degrees
被引:0
|作者:
Anstee, RP
[1
]
机构:
[1] UNIV OTAGO,DEPT MATH & STAT,DUNEDIN,NEW ZEALAND
关键词:
D O I:
10.1002/(SICI)1097-0118(199612)23:4<377::AID-JGT7>3.0.CO;2-O
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
For a general graph G and integer k, the paper proves the existence of a decomposition of G into k 1/kG subgraphs whose degrees are close to 1/k of the corresponding degrees in G and each subgraph has approximately 1/k\E(G)\ edges. (C) 1996 John Wiley & Sons, Inc.
引用
收藏
页码:377 / 384
页数:8
相关论文