An infinite antichain of planar tanglegrams
From MaRDI portal
Publication:2140994
DOI10.1007/S11083-021-09563-6OpenAlexW3140747030MaRDI QIDQ2140994FDOQ2140994
Authors: Éva Czabarka, Stephen J. Smith, 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
Recommendations
permutationpartial orderantichaintanglegrambinary treepermutation patterncaterpillarwell-quasi-orderinginduced subtanglegraminduced subtreeplanar tanglegram
Cites Work
- Graph minors. XX: Wagner's conjecture
- Drawing (complete) binary tanglegrams
- The shape of random tanglegrams
- On the enumeration of tanglegrams and tangled chains
- Title not available (Why is that?)
- Sorting Using Networks of Queues and Stacks
- Counting tanglegrams with species
- The theory of well-quasi-ordering: a frequently discovered concept
- Graph minors. VIII: A Kuratowski theorem for general surfaces
- Well-quasi-orderings and sets of finite sequences
- Ordering by Divisibility in Abstract Algebras
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- A faster fixed-parameter approach to drawing binary tanglegrams
- An infinite antichain of permutations
- Drawing binary tanglegrams: an experimental evaluation
- Comparing trees via crossing minimization
- Analogies between the crossing number and the tangle crossing number
- Inducibility in binary trees and crossings in random tanglegrams
- Title not available (Why is that?)
- A tanglegram Kuratowski theorem
Cited In (3)
Uses Software
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)
