3 papers
math.CO2025
Tanglegrams with a Unique 1-Crossing-Critical Subtanglegram have Tangle Crossing Number 1
Éva Czabarka, Alec Helm, László Székely
A tanglegram of size n is a graph formed from two rooted binary trees with n leaves each and a perfect matching between their leaf sets. Tanglegrams are used to model co-evolution…
math.CO2023
The largest crossing number of tanglegrams
Éva Czabarka, Junsheng Liu, László A. Székely
A tanglegram consists of two rooted binary trees with the same number of leaves, and a perfect matching between the two leaf sets. In a layout, the tanglegrams is drawn wi…
math.CO2021
Maximum diameter of - and -colorable graphs
Éva Czabarka, Stephen J. Smith, László Székely
P. Erdős, J. Pach, R. Pollack, and Z. Tuza [J. Combin. Theory, B 47 (1989), 279--285] made conjectures for the maximum diameter of connected graphs without a complete subgraph $K_{…