| 陈怀堂.关于图升分解为独立边集问题[J].数学研究及应用,1994,14(1):61~64 |
| 关于图升分解为独立边集问题 |
| On the Problem of Ascending SubgraphDecompositions into Matchings |
| 投稿时间：1991-12-12 |
| DOI：10.3770/j.issn:1000-341X.1994.01.009 |
| 中文关键词: |
| 英文关键词: |
| 基金项目: |
|
| 摘要点击次数: 2068 |
| 全文下载次数: 1223 |
| 中文摘要: |
| Ａｌａｖｉ［１］给出了图的升分解概念，并猜想每一图都可升分解．本文证明了边数为（?）的图Ｇ当边色数Ｘ＇（Ｇ）≤（ｎ＋２）／２时可升分解为{Gi}, 1≤i≤n, Gi≈iK2． |
| 英文摘要: |
| Alavi has given the definition of the ascending subgraph decomposition. Heconjectured that every graph of positive size has an asceuding subgraph decomposition.In this paper it is proved that a graph G of size (?)has an ascending subgraphdecomposition {Gi}, 1≤i≤n, with Gi≈iK2 if the edge chromatic number x＇(G)≤(n + 2)/2. |
| 查看全文 查看/发表评论 下载PDF阅读器 |
|
|
|
