Characterizing planar tanglegram layouts and applications to edge insertion problems

DOI10.37236/11299zbMath1516.05028arXiv2201.10533OpenAlexW4379229485MaRDI QIDQ6162140

Kevin Fong-Rey Liu

Publication date: 15 June 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.10533

zbMATH Keywords

rooted binary treestanglegram layout problem

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

Sampling planar tanglegrams and pairs of disjoint triangulations

Cites Work

• Unnamed Item
• Unnamed Item
• The shape of random tanglegrams
• On the enumeration of tanglegrams and tangled chains
• Comparing trees via crossing minimization
• Analogies between the crossing number and the tangle crossing number
• Inserting an edge into a planar graph
• Counting tanglegrams with species
• Crossing Number is NP-Complete
• On the Crossing Number of Almost Planar Graphs
• Drawing (Complete) Binary Tanglegrams
• A tanglegram Kuratowski theorem
• Planar tanglegram layouts and single edge insertion

This page was built for publication: Characterizing planar tanglegram layouts and applications to edge insertion problems