Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs-Reference-Cited by-同舟云学术

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

Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs

Published:2011-07 Issue:4 Volume:101 Page:214-236
ISSN:0095-8956
Container-title:Journal of Combinatorial Theory, Series B
language:en
Short-container-title:Journal of Combinatorial Theory, Series B

Author:

Bilinski Mark,Jackson Bill,Ma Jie,Yu Xingxing

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference49 articles.

1. Color-coding;Alon;J. ACM,1995

2. Removable edges in cyclically 4-connected cubic graphs;Andersen;Graphs Combin.,1988

3. Trees in polyhedral graphs;Barnette;Canad. J. Math.,1966

4. Inclusion and exclusion algorithm for the Hamiltonian path problem;Bax;Inform. Process. Lett.,1993

5. On the approximation of finding a (nother) Hamiltonian cycle in cubic Hamiltonian graphs;Bazgan;J. Algorithms,1999

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

1. On 2-factors with long cycles in 3-connected claw-free graphs;Discrete Mathematics;2024-10

2. Dual Circumference and Collinear Sets;Discrete & Computational Geometry;2022-09-12

3. On the Circumference of 3-Connected Cubic Triangle-Free Plane Graphs;Journal of Mathematics;2021-08-14

4. Edge decomposition of connected claw-free cubic graphs;Discrete Applied Mathematics;2020-09

5. On the Parameterized Complexity of Edge-Linked Paths;Computer Science – Theory and Applications;2019

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP