COVERING TWO DIGRAPHS WITH ARBORESCENCES

在线阅读 下载PDF 导出详情
摘要 LetG1andG2befinitedigraphs,bothwithvertexsetV.SupposethateachvertexvofVhasnonnegativeintegersf(v)andg(v)withf(v)≤g(v),andeacharceofG4hasnonnegativeintegersai(e)andbi(e)withai(e)≤bi(e),i=1,2.InthispaperwegiveanecessaryandsufficientconditionfortheexistenceofkarborescencesinG4coveringeachare(?)ofGiatleastai(e)andatmostbi(e)times,i=1,2,andsatisfyingtheconditionthatforeachvinVf(v)≤r1(v)=r2(v)≤g(v)wherer4(v)denotethenumberofthearborescencesinG?rootedatv.
机构地区 不详
出版日期 1990年03月13日(中国期刊网平台首次上网日期,不代表论文的发表时间)
  • 相关文献