Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference50 articles.
1. Infinite highly connected digraphs with no two arc-disjoint spanning trees;Aharoni;J. Graph Theory,1989
2. Every 3-connected, locally connected claw-free graph is Hamilton-connected;Asratian;J. Graph Theory,1996
3. Modern Graph Theory;Bollobás,1998
4. Extremal Graph Theory;Bollobás,1978
5. H. Bruhn, R. Diestel, J. Pott, Dual trees can share their ends, Preprint, 2009.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. How to frame innovation in mathematics;Synthese;2023-09-25
2. Characterising k-connected sets in infinite graphs;Journal of Combinatorial Theory, Series B;2022-11
3. On Ramsey-Minimal Infinite Graphs;The Electronic Journal of Combinatorics;2021-03-12
4. An analogue of Edmonds’ Branching Theorem for infinite digraphs;European Journal of Combinatorics;2021-02
5. Excluding a full grid minor;Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg;2017-01-04