Characterisations of Planar Galled Networks

arXiv:2609.28597 · math.CO, q-bio.PE · Submitted 2026-09-23 · Read on arXiv

math.CO, q-bio.PE

Submitted: 2026-09-23

Updated: 2026-10-01

Terminology

• Computational Biology — 4× in this paper · explained in 2 episodes
• Combinatorial Optimization — 1× in this paper · explained in 2 episodes

Sources

• A characterization of terminal planar networks by forbidden structures

Related papers

• Exponential random graph models with soft clique constraints
• Exact Enumeration of Phylogenetic Networks: The Tree-Child, Reticulation-Visible and Orchard Hierarchy
• Sedentary quantum walks on bipartite and planar graphs