| 黄光鑫,尹凤.关于一类(g,f)-3-覆盖图的判据[J].数学研究及应用,2006,26(3):623~626 |
| 关于一类(g,f)-3-覆盖图的判据 |
| Criterion for a Type of (g,f)-3-Covered Graphs |
| 投稿时间：2004-05-17 |
| DOI：10.3770/j.issn:1000-341X.2006.03.030 |
| 中文关键词: 图 因子 覆盖图 $(g,f)$-3-覆盖图. |
| 英文关键词:graph factor covered graph $(g,f)$-3-covered graph. |
| 基金项目:重庆市教委科学技术基金(960384) |
|
| 摘要点击次数: 3163 |
| 全文下载次数: 1303 |
| 中文摘要: |
| 本文首先给出了$(g,f)$-3-覆盖图的定义,即一个图$G$称为$(g,f)$-3-覆盖图,如果$G$的任何三条边都属于它的一个$(g,f)$-因子; 其次,黄光鑫曾先后给出了当$g
|
| 英文摘要: |
| First, $(g,f)$-3-covered graph is defined. A graph $G$ is called a $(g,f)$-3-covered graph if every three edges belong to a $(g,f)$-factor. Then a necessary and sufficient condition for a bipartite graph $G=(X,Y)$ to be $(g,f)$-3-covered is given when $g\leq f$. Moreover, a necessary and sufficient condition for a bipartitle graph $G=(X,Y)$ to be $f$-3-covered is obtained. |
| 查看全文 查看/发表评论 下载PDF阅读器 |
|
|
|
