Cycles of length 0 modulo 4 in graphs-Reference-Cited by-同舟云学术

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

Cycles of length 0 modulo 4 in graphs

Published:1993-10 Issue:1-3 Volume:121 Page:37-49
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Dean Nathaniel,Lesniak Linda,Saito Akira

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference19 articles.

1. Modularity of cycles and paths in graphs;Arkin,1986

2. Cycles of length 0 modulo 3 in graphs;Barefoot;Sixth Internat. Conf. on the Theory and Applications of Graphs,1988

3. Graphs and Digraphs;Chartrand,1986

4. Cycles modulo k;Bollobas;Bull. London Math. Soc.,1977

5. Large cycles in graphs;Bondy;Discrete Math.,1971

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

1. 4-Chromatic Graphs Have At Least Four Cycles of Length $0 \bmod 3$;The Electronic Journal of Combinatorics;2024-06-28

2. On two cycles of consecutive even lengths;Journal of Graph Theory;2024-01-24

3. Cycle lengths modulo k in expanders;European Journal of Combinatorics;2023-03

4. A Unified Proof of Conjectures on Cycle Lengths in Graphs;International Mathematics Research Notices;2021-01-05

5. Cycle Lengths in Expanding Graphs;Combinatorica;2020-11-30

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP