Polynomial algorithms for computing the isolated toughness of interval and split graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Polynomial algorithms for computing the isolated toughness of interval and split graphs

Published:2021-04-24 Issue: Volume: Page:
ISSN:1532-0626
Container-title:Concurrency and Computation: Practice and Experience
language:en
Short-container-title:Concurrency Computat Pract Exper

Author:

Li Fengwei¹,Ye Qingfang¹,Broersma Hajo²,Zhang Xiaoyan³^ORCID

Affiliation:

1. College of Basic Science Ningbo University of Finance and Economics Ningbo P.R. China

2. Faculty of EEMCS University of Twente Enschede the Netherlands

3. School of Mathematical Sciences and Institute of Mathematics Nanjing Normal University Nanjing P.R. China

Funder

National Natural Science Foundation of China

Natural Science Foundation of Zhejiang Province

Qinglan Project of Jiangsu Province of China

Publisher

Wiley

Subject

Computational Theory and Mathematics,Computer Networks and Communications,Computer Science Applications,Theoretical Computer Science,Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/cpe.6345

Reference29 articles.

1. Graph Theory with Applications

2. Tough graphs and hamiltonian circuits

3. Toughness and the existence ofk-factors

4. Isolated toughness and the existence of fractional factors in graphs;Ma Y;Acta Appl Math Sin (in Chinese),2003

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP