One-to-one disjoint path covers in digraphs-Reference-Cited by-同舟云学术

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

One-to-one disjoint path covers in digraphs

Published:2018-03 Issue: Volume:714 Page:27-35
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Cao Huabin,Zhang Bicheng,Zhou Zhiheng

Funder

Hunan Province College Students Research Learning and Innovative Experiment

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference21 articles.

1. On spanning connected graphs;Lin;Discrete Math.,2008

2. The 1-fixed-endpoint path cover problem is polynomial on interval graphs;Asdre;Algorithmica,2010

3. On path cover problems in digraphs and applications to program testing;Ntafos;IEEE Trans. Softw. Eng.,1979

4. Paired many-to-many disjoint path covers of the hypercubes;Chen;Inform. Sci.,2013

5. Partitions of faulty hypercubes into paths with prescribed endvertices;Dvořák;SIAM J. Discrete Math.,2008

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs;Discrete Mathematics;2023-08

2. Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults;International Journal of Foundations of Computer Science;2022-11-09

3. Characterization of interval graphs that are paired 2-disjoint path coverable;The Journal of Supercomputing;2022-08-22

4. Unpaired Many-to-Many Disjoint Path Covers in Nonbipartite Torus-Like Graphs With Faulty Elements;IEEE Access;2022

5. A sufficient condition for the unpaired k-disjoint path coverability of interval graphs;The Journal of Supercomputing;2021-01-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3