An infinite antichain of planar tanglegrams
From MaRDI portal
Publication:2140994
DOI10.1007/s11083-021-09563-6OpenAlexW3140747030MaRDI QIDQ2140994
Stephen J. Smith, Éva Czabarka, László A. Székely
Publication date: 23 May 2022
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.06091
binary treeantichainpermutationpartial orderwell-quasi-orderingcaterpillarpermutation patterntanglegraminduced subtanglegraminduced subtreeplanar tanglegram
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The shape of random tanglegrams
- On the enumeration of tanglegrams and tangled chains
- Graph minors. XX: Wagner's conjecture
- Comparing trees via crossing minimization
- Analogies between the crossing number and the tangle crossing number
- An infinite antichain of permutations
- Counting tanglegrams with species
- Drawing (complete) binary tanglegrams
- The theory of well-quasi-ordering: a frequently discovered concept
- Graph minors. VIII: A Kuratowski theorem for general surfaces
- A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
- Well-quasi-orderings and sets of finite sequences
- A tanglegram Kuratowski theorem
- Drawing Binary Tanglegrams: An Experimental Evaluation
- Inducibility in Binary Trees and Crossings in Random Tanglegrams
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- Sorting Using Networks of Queues and Stacks
- Ordering by Divisibility in Abstract Algebras
This page was built for publication: An infinite antichain of planar tanglegrams
