The graph crossing number and its variants: A survey
M Schaefer - The electronic journal of combinatorics, 2012 - combinatorics.org
The crossing number is a popular tool in graph drawing and visualization, but there is not
really just one crossing number; there is a large family of crossing number notions of which …
really just one crossing number; there is a large family of crossing number notions of which …
2-Layer k-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth
P Angelini, G Da Lozzo, H Förster… - The Computer …, 2024 - academic.oup.com
The-layer drawing model is a well-established paradigm to visualize bipartite graphs where
vertices of the two parts lie on two horizontal lines and edges lie between these lines …
vertices of the two parts lie on two horizontal lines and edges lie between these lines …
Characterizing planar tanglegram layouts and applications to edge insertion problems
K Liu - arXiv preprint arXiv:2201.10533, 2022 - arxiv.org
Tanglegrams are formed by taking two rooted binary trees $ T $ and $ S $ with the same
number of leaves and uniquely matching each leaf in $ T $ with a leaf in $ S $. They are …
number of leaves and uniquely matching each leaf in $ T $ with a leaf in $ S $. They are …
The largest crossing number of tanglegrams
A tanglegram $\cal T $ 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 with …
and a perfect matching between the two leaf sets. In a layout, the tanglegrams is drawn with …
[PDF][PDF] Planar tanglegram layouts and single edge insertion
K Liu - Séminaire Lotharingien de Combinatoire B - mat.univie.ac.at
Tanglegrams are formed by taking two rooted binary trees T and S with the same number of
leaves and uniquely matching each leaf in T with a leaf in S. They are usually represented …
leaves and uniquely matching each leaf in T with a leaf in S. They are usually represented …
Tangled up in Tanglegrams
DJ Scalzo - 2022 - search.proquest.com
Tanglegrams are graphs consisting of two rooted binary plane trees with the same number
of leaves and a perfect matching between the two leaf sets. A Tanglegram drawing is a …
of leaves and a perfect matching between the two leaf sets. A Tanglegram drawing is a …
An infinite antichain of planar tanglegrams
Contrary to the expectation arising from the tanglegram Kuratowski theorem of Czabarka et
al.(SIAM J. Discrete Math. 31 (3), 1732–1750, 2017), we construct an infinite antichain of …
al.(SIAM J. Discrete Math. 31 (3), 1732–1750, 2017), we construct an infinite antichain of …