加载中…
A digraph 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 , all plane digraphs not containing as a semi-strong minor have bounded width, while plane digraphs in general have unbounded width.

生成讲解博客的中文版本

生成AI智能校验的中文版本