Paper
A characterization of terminal planar networks by forbidden structures
Authors
Haruki Miyaji, Yuki Noguchi, Hexuan Liu, Takatora Suzuki, Keita Watanabe, Taoyang Wu, Momoko Hayamizu
Abstract
The class of terminal planar networks was recently introduced from a biological perspective in relation to the visualization of phylogenetic networks, and its connection to upward planar networks has been established. We provide a Kuratowski-type theorem that characterizes terminal planar networks by a finite set of forbidden structures, defined via six families of 0/1-labeled graphs. Another characterization based on planarity of supergraphs yields linear-time algorithms for testing terminal planarity and for computing such planar drawings. We describe an application that is potentially relevant in broader, non-phylogenetic settings. We also discuss a connection of our main result to an open problem on the forbidden structures of single-source upward planar networks.
Metadata
Related papers
Fractal universe and quantum gravity made simple
Fabio Briscese, Gianluca Calcagni • 2026-03-25
POLY-SIM: Polyglot Speaker Identification with Missing Modality Grand Challenge 2026 Evaluation Plan
Marta Moscati, Muhammad Saad Saeed, Marina Zanoni, Mubashir Noman, Rohan Kuma... • 2026-03-25
LensWalk: Agentic Video Understanding by Planning How You See in Videos
Keliang Li, Yansong Li, Hongze Shen, Mengdi Liu, Hong Chang, Shiguang Shan • 2026-03-25
Orientation Reconstruction of Proteins using Coulomb Explosions
Tomas André, Alfredo Bellisario, Nicusor Timneanu, Carl Caleman • 2026-03-25
The role of spatial context and multitask learning in the detection of organic and conventional farming systems based on Sentinel-2 time series
Jan Hemmerling, Marcel Schwieder, Philippe Rufin, Leon-Friedrich Thomas, Mire... • 2026-03-25
Raw Data (Debug)
{
"raw_xml": "<entry>\n <id>http://arxiv.org/abs/2603.16657v1</id>\n <title>A characterization of terminal planar networks by forbidden structures</title>\n <updated>2026-03-17T15:25:49Z</updated>\n <link href='https://arxiv.org/abs/2603.16657v1' rel='alternate' type='text/html'/>\n <link href='https://arxiv.org/pdf/2603.16657v1' rel='related' title='pdf' type='application/pdf'/>\n <summary>The class of terminal planar networks was recently introduced from a biological perspective in relation to the visualization of phylogenetic networks, and its connection to upward planar networks has been established. We provide a Kuratowski-type theorem that characterizes terminal planar networks by a finite set of forbidden structures, defined via six families of 0/1-labeled graphs. Another characterization based on planarity of supergraphs yields linear-time algorithms for testing terminal planarity and for computing such planar drawings. We describe an application that is potentially relevant in broader, non-phylogenetic settings. We also discuss a connection of our main result to an open problem on the forbidden structures of single-source upward planar networks.</summary>\n <category scheme='http://arxiv.org/schemas/atom' term='math.CO'/>\n <published>2026-03-17T15:25:49Z</published>\n <arxiv:comment>29 pages, 12 figures</arxiv:comment>\n <arxiv:primary_category term='math.CO'/>\n <author>\n <name>Haruki Miyaji</name>\n </author>\n <author>\n <name>Yuki Noguchi</name>\n </author>\n <author>\n <name>Hexuan Liu</name>\n </author>\n <author>\n <name>Takatora Suzuki</name>\n </author>\n <author>\n <name>Keita Watanabe</name>\n </author>\n <author>\n <name>Taoyang Wu</name>\n </author>\n <author>\n <name>Momoko Hayamizu</name>\n </author>\n </entry>"
}