Work

Minors of plane digraphs

Year: 2026

Type: preprint

Abstract: A digraph $H$ is a ``semi-strong minor'' of another, $G$, if a subdivision of $H$ can be obtained from a subdigraph of $G$ by contracting strongly-connected subdigraphs to single vertices. We will define a width measure of ``plane'' digraphs (that is, drawn in the plane) based on a kind of branch-composition, and show that for every plane digraph $H$, all plane digraphs not containing $H$ as a semi-strong minor have bounded width, while plane digraphs in general have unbounded width.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2604.00833

Authors: Chudnovsky, Maria, Seymour, Paul

Institution: Princeton University

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, Air Force Office of Scientific Research

Awards: G1523888516, G3634836354, Collaborative Research: AF:Medium: Structure and Quasi-Polynomial Time Algorithms, DMS-EPRSC: Induced Subgraphs and Graph Structure, Forbidding Induced Subgraphs: Decompositions, Coloring and Algorithms, G6447070560

OpenAlex ID: W7148530978

Cites:

Cited by:

Related to: