Recommendations
Cites work
- scientific article; zbMATH DE number 3492580 (Why is no real title available?)
- scientific article; zbMATH DE number 7359764 (Why is no real title available?)
- A faster fixed-parameter approach to drawing binary tanglegrams
- A tanglegram Kuratowski theorem
- An infinite antichain of permutations
- Analogies between the crossing number and the tangle crossing number
- Comparing trees via crossing minimization
- Counting tanglegrams with species
- Drawing (complete) binary tanglegrams
- Drawing binary tanglegrams: an experimental evaluation
- Graph minors. VIII: A Kuratowski theorem for general surfaces
- Graph minors. XX: Wagner's conjecture
- Inducibility in binary trees and crossings in random tanglegrams
- On the enumeration of tanglegrams and tangled chains
- Ordering by Divisibility in Abstract Algebras
- Sorting Using Networks of Queues and Stacks
- The shape of random tanglegrams
- The theory of well-quasi-ordering: a frequently discovered concept
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Well-quasi-orderings and sets of finite sequences
Cited in
(3)
This page was built for publication: An infinite antichain of planar tanglegrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140994)
