| 引用本文： |
-
黄娟,李乃医.[a,b]-消去图的一个充分条件[J].广西科学,2006,13(4):253-254. [点击复制]
- HUANG Juan,LI Nai-yi.A Sufficient Condition of[a,b]-Delete Graph[J].Guangxi Sciences,2006,13(4):253-254. [点击复制]
|
|
| 摘要: |
| 在研究K1,3-free图与图的最小度之间的关系基础上,给出K1,3-free图是[a,b]-消去图的一个充分条件. |
| 关键词: K1,3-free图 [a,b]-消去图 最小度 |
| DOI： |
| 投稿时间：2006-06-05修订日期：2006-09-10 |
| 基金项目: |
|
| A Sufficient Condition of[a,b]-Delete Graph |
|
HUANG Juan, LI Nai-yi
|
| (Department of Mathematics, Guangdong Ocean University, Zhanjiang, Guangdong, 524088, China) |
| Abstract: |
| Based on the studying of the relations between K1,3-free graph and the minimum degree,we give a sufficient condition of[a,b]-delete graph. |
| Key words: K1,3-free graph [a,b]-delete graph minimum degree |
