Configurations in Graphs of Large Minimum Degree, Connectivity, or Chromatic Number-Reference-Cited by-同舟云学术

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

Configurations in Graphs of Large Minimum Degree, Connectivity, or Chromatic Number

Published:1989-05 Issue:1 Combinatorial Volume:555 Page:402-412
ISSN:0077-8923
Container-title:Annals of the New York Academy of Sciences
language:en
Short-container-title:Ann NY Acad Sci

Author:

THOMASSEN CARSTEN

Publisher

Wiley

Subject

History and Philosophy of Science,General Biochemistry, Genetics and Molecular Biology,General Neuroscience

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1111/j.1749-6632.1989.tb22479.x/fullpdf

Reference43 articles.

1. 1. R. Aharoni, and C. Thomassen. Infinite highly connected digraphs with no two aredisjoint spanning trees . J. Graph Theory.In press.

2. Subgraphs of large connectivity and chromatic number in graphs of large chromatic number

3. Cycles Modulo k

4. Semi-topological subgraphs

5. 5. B. Bollobas, 1978 . Nested cycles in graphs. In Proceedings of the Colloquium International CNRS 260, pp. 49 -50 .

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

1. The Nash-Williams orientation theorem for graphs with countably many ends;European Journal of Combinatorics;2025-02

2. A Conjecture Generalizing Thomassen’s Chord Conjecture in Graph Theory;Bulletin of the Iranian Mathematical Society;2024-08-19

3. Strong arc decompositions of split digraphs;Journal of Graph Theory;2024-08-06

4. Arc-disjoint out- and in-branchings in compositions of digraphs;European Journal of Combinatorics;2024-08

5. Sublinear Expanders and Their Applications;Surveys in Combinatorics 2024;2024-06-13

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP