Planar tanglegram layouts and single edge insertion

zbMath1515.05047MaRDI QIDQ6103811

Kevin Fong-Rey Liu

Publication date: 5 June 2023

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: http://www.mat.univie.ac.at/~slc/wpapers/FPSAC2022//45.html

zbMATH Keywords

treetanglegramlayoutcrossingedge insertion

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Characterizing planar tanglegram layouts and applications to edge insertion problems

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
• The On-Line Encyclopedia of Integer Sequences
• Drawing (complete) binary tanglegrams
• Crossing Number is NP-Complete
• A tanglegram Kuratowski theorem

This page was built for publication: Planar tanglegram layouts and single edge insertion