Large Wk- or K3,t-Minors in 3-Connected Graphs-Reference-Cited by-同舟云学术

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

Large Wk- or K3,t-Minors in 3-Connected Graphs

Published:2015-08-04 Issue:2 Volume:82 Page:207-217
ISSN:0364-9024
Container-title:Journal of Graph Theory
language:en
Short-container-title:J. Graph Theory

Author:

Ding Guoli¹,Dziobiak Stan²,Wu Haidong³

Affiliation:

1. DEPARTMENT OF MATHEMATICS; LOUISIANA STATE UNIVERSITY; BATON ROUGE LOUISIANA

2. DEPARTMENT OF MATHEMATICAL SCIENCES; UNIVERSITY OF PUERTO RICO AT MAYAGUEZ; MAYAGUEZ PUERTO RICO

3. DEPARTMENT OF MATHEMATICS; UNIVERSITY OF MISSISSIPPI, UNIVERSITY; MISSISSIPPI

Funder

National Science Foundation

National Security Agency

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Reference11 articles.

1. Relative lengths of paths and cycles in 3-connected graphs;Bondy;Discrete Math,1981

2. A decomposition for combinatorial geometries;Brylawski;Trans Amer Math Soc,1972

3. Long cycles in 3-connected graphs;Chen;J Combin Theory Ser B,2002

4. The circumference of a graph with no K3,t-minor, II;Chen;J Combin Theory Ser B,2012

5. Capturing two elements in unavoidable minors of 3-connected binary matroids;Chun;Adv Appl Math,2013

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

1. An Unsupervised Learning Framework Combined with Heuristics for the Maximum Minimal Cut Problem;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

2. On the bond polytope;Advances in Geometry;2023-10-01

3. Characterizing matroids whose bases form graphic delta-matroids;European Journal of Combinatorics;2022-03

4. Computing the Largest Bond and the Maximum Connected Cut of a Graph;Algorithmica;2021-01-08

5. Branch-depth: Generalizing tree-depth of graphs;European Journal of Combinatorics;2020-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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