Digraph decompositions and Eulerian systems
Digraph decompositions and Eulerian systems
复制标题
有向图分解和欧拉系统
DOI：
10.1137/0608028
复制
发表时间：
1987
期刊：
影响因子：
--
通讯作者：
A. Bouchet
中科院分区：
文献类型：
--
作者：
A. Bouchet
介绍了W. Cunningham和作者提出的各向同性系统理论是统一的。一个基本的组合工具是在有向图的顶点处的局部补运算，这是已知的简单图的类似运算的推广。这使我们能够统一在一个单一的类的半脆性有向图特征在于W。坎宁安和设计一个更有效的算法，寻找分裂的有向图。
The theory of digraph decompositions introduced by W. Cunningham and the theory of isotropic systems introduced by the author are unified. A basic combinatorial tool is the operation of local complementation at a vertex of a digraph, a generalization of the similar operation already known for simple graphs. This allows us to unify in a single class the semibrittle digraphs characterized by W. Cunningham and to devise a more efficient algorithm for searching for a split of a digraph.