6 citations · 6 across the 4 of their papers we have counts for
4 papers · 1 filter
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…
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_{…
Midrange crossing constants for graphs classes
Éva Czabarka, Josiah Reiswig, László Székely +1
For positive integers and , let be the minimum crossing number (the standard planar crossing number) taken over all graphs with vertices and at least edges.…
Erdős-Szekeres theorem for cyclic permutations
Éva Czabarka, Zhiyu Wang
We provide a cyclic permutation analogue of the Erd\H os-Szekeres theorem. In particular, we show that every cyclic permutation of length has either an increasing…