A Reduction Method for Edge-Connectivity in Graphs-Reference-Cited by-同舟云学术

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

A Reduction Method for Edge-Connectivity in Graphs

Published:1978 Issue: Volume: Page:145-164
ISSN:0167-5060
Container-title:Advances in Graph Theory
language:
Short-container-title:

Author:

Mader W.

Publisher

Elsevier

Reference12 articles.

1. Flows in Networks;Ford,1962

2. Zum Mengerschen Graphensatz, in Beiträge zur Graphentheorie;Halin,1968

3. Súvilost a pravidelná súvilost konečných grafov;Kotzig,1956

4. A. Kotzig, Vertex splittings preserving the maximal edge connectedness of 4-regular multigraphs, to appear in J. Combinatorial Theory (B).

5. On some connectivity properties of eulerian graphs;Lovász;Acta Math. Acad. Sci. Hung.,1976

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

1. A Better-Than-1.6-Approximation for Prize-Collecting TSP;Lecture Notes in Computer Science;2024

2. Graphs of scramble number two;Discrete Mathematics;2023-10

3. Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs;SIAM Journal on Discrete Mathematics;2023-07-20

4. An Improved Approximation Guarantee for Prize-Collecting TSP;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

5. Resilient Routing Table Computation Based on Connectivity Preserving Graph Sequences;IEEE INFOCOM 2023 - IEEE Conference on Computer Communications;2023-05-17

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP