期刊文献+

二部图的因子k-覆盖与因子k-消去

Factorkcovered and Factorkdeleted Bipartite Graphs
下载PDF
导出
摘要 一个图G称为因子k-覆盖的,如果G的任意k条边都属于G的某类因子.G称为因子k-消去的,如果删去G的任意k条边后所得的图仍有某类因子.在二部图的情形下,给出了关于(g,f)-因子、f-因子的k-覆盖和k-消去同时成立的充分条件.对非二部图g<f的情况,得出了(g,f)-因子k-覆盖和k-消去成立的充分条件. A graph G is called factor-k-covered if any k edges of G contained in some kind of factors. G is termed factor-k-deleted if G-A contains a kind of factors for any k edges of G forming set A. We obtain sufficient conditions for a bipartite graph to be k-covered and k-deleted about (g, f)-factor, f-factor. Same resuits are obtained for non-bipartite graph in the conditions of g〈f.
作者 陈京荣
出处 《兰州交通大学学报》 CAS 2006年第6期141-143,共3页 Journal of Lanzhou Jiaotong University
基金 甘肃省自然科学基金(3XS051-A25-030)
关键词 因子 覆盖 消去 graph factor covered delet ed
  • 引文网络
  • 相关文献

参考文献6

  • 1LováL sz.The factorization of graphs Ⅱ[J].Acta.Math.Acad.Sci.Hangar,1972,23:223-246.
  • 2Little C H C.A theorem on connected graphs in which every edge belongs to a l-factor[J].J.Austra.Math.Soc,1974,18:450-452.
  • 3Liu,Guizhen.On(g,f)-covered graphs[J].Acta Math.Sinica,1988,8:181-184.
  • 4刘桂真.图的(g,f)-因子和因子分解[J].数学学报(中文版),1994,37(2):230-237. 被引量:29
  • 5Heinrich K,Hell P,Kirkpatrick D G,et al.A simple existence criterion for (g,f)-factors[J].Discrete Math,1990,85:313-317.
  • 6Lovász L,Plummer M D.Matching theory[M].North-Holland(Amsterdan):Annals of Discrete Mathematics,1986.

二级参考文献4

  • 1Cai M C,Discrete Math,1991年,98卷,225页
  • 2Cai M C,J Graph Theory,1991年,15卷,283页
  • 3刘桂真,Acta Math Sci,1988年,8卷,181页
  • 4王其华,数学物理学报

共引文献28

;
使用帮助 返回顶部