Tree Sets-Reference-Cited by-同舟云学术

Tree Sets

Published:2017-04-25 Issue:1 Volume:35 Page:171-192
ISSN:0167-8094
Container-title:Order
language:en
Short-container-title:Order

Author:

Diestel Reinhard^ORCID

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Geometry and Topology,Algebra and Number Theory

Link

http://link.springer.com/article/10.1007/s11083-017-9425-4/fulltext.html

Reference15 articles.

1. Bowler, N., Diestel, R., Mazoit, F.: Tangle-tree duality in infinite graphs. In preparation

2. Diestel, R.: Abstract separation systems, arXiv: 1406.3797 . Order (2017). doi: 10.1007/s11083-017-9424-5

3. Diestel, R.: Graph Theory (5th edition, 2016). Springer-Verlag, 2017. Electronic edition available at http://diestel-graph-theory.com/

4. Diestel, R., Erde, J., Eberenz, P.: Duality theorem for blocks and tangles in graphs. arXiv: 1605.09139 , to appear in SIAM J. Discrete Mathematics (2016)

5. Diestel, R., Hundertmark, F., Lemanczyk, S.: Profiles of separations: in graphs, matroids, and beyond. arXiv: 1110.6207 , to appear in Combinatorica (2017)

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

1. Efficiently distinguishing all tangles in locally finite graphs;Journal of Combinatorial Theory, Series B;2024-07

2. Entanglements;Journal of Combinatorial Theory, Series B;2024-01

3. Canonical decompositions of 3-connected graphs;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. Treat Molecular Linear Notations as Sentences: Accurate Quantitative Structure–Property Relationship Modeling via a Natural Language Processing Approach;Industrial & Engineering Chemistry Research;2023-03-08

5. Characterising k-connected sets in infinite graphs;Journal of Combinatorial Theory, Series B;2022-11