Characterisations of Planar Galled Networks
math.CO, q-bio.PE
Submitted: 2026-09-23
Updated: 2026-10-01
Comments: 34 pages, 9 figures
License: http://creativecommons.org/licenses/by/4.0/
The gist: Rooted phylogenetic networks are widely used to represent the evolution of species that have undergone reticulate processes.
Terminology
Abstract
Rooted phylogenetic networks are widely used to represent the evolution of species that have undergone reticulate processes. However, these networks can be highly non-planar, making them more difficult to visualise and interpret than evolutionary trees. In this paper, we investigate planarity properties of galled networks, an important subclass of phylogenetic networks. We show that all planar galled networks are necessarily upward planar. Furthermore, by leveraging recent results on planar phylogenetic networks, we provide three characterisations for each of the outerplanar and terminal planar galled network classes in terms of forbidden vertex configurations, forbidden directed subgraphs, and forbidden structures in their associated underlying undirected graphs. These results contribute to a deeper understanding of the structural properties of galled networks and may inform future methods for their construction and visualisation.
Sources
Related papers
- Exponential random graph models with soft clique constraints
- Exact Enumeration of Phylogenetic Networks: The Tree-Child, Reticulation-Visible and Orchard Hierarchy
- Arithmetic Circuits and Neural Networks for Regular Matroids
- On composition and decomposition operations for vector spaces, graphs and matroids
- Sedentary quantum walks on bipartite and planar graphs
- An introduction to local differential privacy protocols using block designs