首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Degree sequences and graphs with disjoint spanning trees
Authors:Hong-Jian Lai  Yanting Liang
Institution:
  • a College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, China
  • b Department of Mathematics, West Virginia University, Morgantown, WV 26506, United States
  • c Department of Mathematics, HuiZhou University, HuiZhou, Guangdong 561007, China
  • Abstract:
    Keywords:Graphic degree sequence  _method=retrieve&  _eid=1-s2  0-S0166218X11001910&  _mathId=si15  gif&  _pii=S0166218X11001910&  _issn=0166218X&  _acct=C000069490&  _version=1&  _userid=6211566&  md5=0d7066ef67c798393d865ec071168d96')" style="cursor:pointer  k edge-disjoint spanning trees" target="_blank">" alt="Click to view the MathML source" title="Click to view the MathML source">k edge-disjoint spanning trees  Strength  Fractional arboricity
    本文献已被 ScienceDirect 等数据库收录!
    设为首页 | 免责声明 | 关于勤云 | 加入收藏

    Copyright©北京勤云科技发展有限公司  京ICP备09084417号