Lymph-node dissection for the treatment of lung cancer: Sampling or complete nodal dissection?
- 作者：Domenico Galetta ; Maria Serra ; Lorenzo Spaggiari
- 关键词：Lung cancer ; Lymph node dissection
- 刊名：Lung Cancer
- 出版年：2008
- 期刊代码：187_01695002
- 类别：med
- 出版时间：April 2008
- 卷：60
- 期：1
- 页码：148-149
- 文件大小：97 K
摘要
The purpose of this paper is to initiate study of the following problem: Let G be a graph, and k
1. Determine the minimum number s of trees T1,…,Ts, Δ(Ti)
k,i=1,…,s, covering all vertices of G. We conjecture: Let G be a connected graph, and k2. Then the vertices of G can be covered by 
edge-disjoint trees of maximum degree k. As a support for the conjecture we prove the statement for some values of δ and k.
1. Determine the minimum number s of trees T1,…,Ts, Δ(Ti)k,i=1,…,s, covering all vertices of G. We conjecture: Let G be a connected graph, and k2. Then the vertices of G can be covered by k. As a support for the conjecture we prove the statement for some values of δ and k.