The following pages link to Reinhard Diestel (Q215083):
Displaying 13 items.
- A Cantor-Bernstein Theorem for Paths in Graphs (Q5440674) (← links)
- (Q5472076) (← links)
- Cycle‐cocycle partitions and faithful cycle covers for locally finite graphs (Q5706480) (← links)
- Menger's theorem for infinite graphs with ends (Q5711777) (← links)
- Every rayless graph has an unfriendly partition (Q5891221) (← links)
- Every rayless graph has an unfriendly partition (Q5894428) (← links)
- Some remarks on universal graphs (Q5903379) (← links)
- A conjecture concerning a limit of non-Cayley graphs (Q5949012) (← links)
- Tangles and the Mona Lisa (Q6271734) (← links)
- Canonical graph decompositions via coverings (Q6507899) (← links)
- Graph theory (to appear) (Q6613246) (← links)
- Point sets and functions inducing tangles of set separations (Q6641727) (← links)
- Traits and tangles: An analysis of the Big Five paradigm by tangle-based clustering (Q6755514) (← links)