A Combinatorial Decomposition Theory
From MaRDI portal
Publication:3884147
DOI10.4153/CJM-1980-057-7zbMath0442.05054MaRDI QIDQ3884147
Jack Edmonds, William H. Cunningham
Publication date: 1980
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
05C65: Hypergraphs
05B35: Combinatorial aspects of matroids and geometric lattices
05C40: Connectivity
Related Items
A separation decomposition for orders, Hamilton cycles in plane triangulations, Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs, A Representation Theorem for Union-Difference Families and Application, Connected hyperplanes in binary matroids, Decomposition of 3-connected cubic graphs, The decomposition of graphs into \(k\)-connected components, Tutte polynomials computable in polynomial time, The structure of the 3-separations of 3-connected matroids, Decomposition of k-ary relations, Canonical decompositions of symmetric submodular systems, A decomposition theory for matroids. I: General results, The structure of 3-connected matroids of path width three, The structure of the 3-separations of 3-connected matroids. II., Completely separable graphs, Decomposition of partial orders, The structure of crossing separations in matroids, Constructive characterizations of 3-connected matroids of path width three, Decomposition of submodular functions, A decomposition of distributive lattices, 1-intersecting families, Connectivity in bicircular matroids, On chains of 3-connected matroids, N-free posets as generalizations of series-parallel posets, A decomposition theory for matroids. V: Testing of matrix total unimodularity, The incidence structure of subspaces with well-scaled frames, Counting labelled three-connected and homeomorphically irreducible two- connected graphs, Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs, Partitive hypergraphs, Separating cocircuits in binary matroids, Connectivity of submodular functions, On testing consecutive-ones property in parallel, Some remarks on Jaeger's dual-hamiltonian conjecture, A \(k\)-structure generalization of the theory of 2-structures, Two representations of finite ordered sets, Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs, Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs, Decomposition of balanced matrices, Quasi-star-cutsets and some consequences, The graph sandwich problem for 1-join composition is NP-complete, Basic perfect graphs and their extensions, The Tutte polynomial of a ported matroid, On separability: Functional structure, Balanced \(0,\pm 1\) matrices. I: Decomposition, The arborescence-realization problem, An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures, Decomposition of wheel-and-parachute-free balanced bipartite graphs, Self-dual graphs, Compositions for perfect graphs, Decomposition of 3-connected graphs, Balanced matrices, The structure of equivalent 3-separations in a 3-connected matroid, Graph decompositions definable in monadic second-order logic, Two disjoint negative cycles in a signed graph, Digraph Decompositions and Eulerian Systems, Forbidden subgraphs and graph decomposition, Decomposition of Directed Graphs
