SIAM Journal on Algebraic and Discrete Methods · 1987 · 39 citations · 7 references
Natural SciencesComputer ScienceMathematicsAlgorithmsCombinatoricsComputational GeometryDirected Acyclic GraphsGraph AlgorithmsGraph TheorySystem DecompositionTopological CombinatoricsComplementationDecompositionsDigraph RepresentationEulerian GraphsGraph Decompositions
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.
7
A Combinatorial Decomposition Theory
William H. Cunningham, Jack Edmonds · Canadian Journal of Mathematics · 1980 · 331 citations · Full text
Decomposition of Directed Graphs
William H. Cunningham · SIAM Journal on Algebraic and Discrete Methods · 1982 · 245 citations
Graph Theory with Applications
E. Kay · Journal of the Operational Research Society · 1977 · 146 citations
Reducing prime graphs and recognizing circle graphs
André Bouchet · COMBINATORICA · 1987 · 138 citations