Sparse Spanning $k$-Connected Subgraphs in Tournaments-Reference-Cited by-同舟云学术

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

Sparse Spanning $k$-Connected Subgraphs in Tournaments

Published:2017-01 Issue:3 Volume:31 Page:2206-2227
ISSN:0895-4801
Container-title:SIAM Journal on Discrete Mathematics
language:en
Short-container-title:SIAM J. Discrete Math.

Author:

Kang Dong Yeap,Kim Jaehoon,Kim Younjin,Suh Geewon

Funder

POSCO TJ Park Foundation

Seventh Framework Programme

National Research Foundation of Korea

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics

Link

https://epubs.siam.org/doi/pdf/10.1137/16M1064805

Reference13 articles.

1. Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs

2. A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs

3. Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs

4. Spanningk-arc-strong subdigraphs with few arcs ink-arc-strong tournaments

5. Partition of graphs with condition on the connectivity and minimum degree

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

1. Tight bounds for powers of Hamilton cycles in tournaments;Journal of Combinatorial Theory, Series B;2023-01

2. On 1-factors with prescribed lengths in tournaments;Journal of Combinatorial Theory, Series B;2020-03

3. Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs;Combinatorics, Probability and Computing;2018-11-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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