A Combinatorial Decomposition Theory

Cited in

(only showing first 100 items - show all)

Characteristics of graph braid groups
\(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
A separation decomposition for orders
Rigidity, global rigidity, and graph decomposition
Practical and efficient split decomposition via graph-labelled trees
Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
Cluster editing: kernelization based on edge cuts
On chains of 3-connected matroids
Bounding and stabilizing realizations of biased graphs with a fixed group
Connectivity in bicircular matroids
The structure of the 4-separations in 4-connected matroids
Decomposition of partial orders
An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs
Quasi-star-cutsets and some consequences
Canonical decompositions of symmetric submodular systems
On computing the Gromov hyperbolicity
The incidence structure of subspaces with well-scaled frames
N-free posets as generalizations of series-parallel posets
Self-dual graphs
Stability, fragility, and Rota's conjecture
Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
Digraph Decompositions and Eulerian Systems
Forbidden subgraphs and graph decomposition
On the 2-sum in rigidity matroids
The structure of the 3-separations of 3-connected matroids
Hamilton cycles in plane triangulations
The arborescence-realization problem
Tree-representation of set families and applications to combinatorial decompositions
The Tutte polynomial of a ported matroid
A decomposition theory for matroids. V: Testing of matrix total unimodularity
Reconstruction of infinite matroids from their 3-connected minors
Unifying the representation of symmetric crossing families and weakly partitive families
A decomposition of distributive lattices
The structure of 3-connected matroids of path width three
The structure of the 3-separations of 3-connected matroids. II.
Decomposition of 3-connected cubic graphs
Distance-hereditary comparability graphs
Some remarks on Jaeger's dual-hamiltonian conjecture
Edge bipartization faster than \(2^k\)
Decomposition of 3-connected representable matroids
Detecting 2-joins faster
Ghost symmetry and an analogue of Steinitz's theorem
Compositions for perfect graphs
The graph sandwich problem for 1-join composition is NP-complete
Tutte polynomials computable in polynomial time
Hamiltonian properties of polyhedra with few 3-cuts. A survey
The structure of equivalent 3-separations in a 3-connected matroid
The structure of 2-separations of infinite matroids
On testing consecutive-ones property in parallel
Decomposition of Directed Graphs
Decomposition of balanced matrices
Counting labelled three-connected and homeomorphically irreducible two- connected graphs
Partitive hypergraphs
Decomposition of submodular functions
Balanced \(0,\pm 1\) matrices. I: Decomposition
A Representation Theorem for Union-Difference Families and Application
A survey of the algorithmic aspects of modular decomposition
Completely separable graphs
A matroid invariant via the \(K\)-theory of the Grassmannian
Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
Computing \(H\)-joins with application to 2-modular decomposition
A supernodal formulation of vertex colouring with applications in course timetabling
Axioms for infinite matroids
Balanced matrices
The structure of crossing separations in matroids
Basic perfect graphs and their extensions
Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\)
Two-sided combinatorial volume bounds for non-obtuse hyperbolic polyhedra
The decomposition of graphs into \(k\)-connected components
On the complexity of matroid isomorphism problem
Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs
Cluster editing: kernelization based on edge cuts
A decomposition theory for matroids. I: General results
2-clique-bond of stable set polyhedra
Structure and enumeration of two-connected graphs with prescribed three-connected components
Constructive characterizations of 3-connected matroids of path width three
Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs
A polynomial kernel for distance-hereditary vertex deletion
Knocking out \(P_k\)-free graphs
On minimally non-firm binary matrices
1-intersecting families
On polygon numbers of circle graphs and distance hereditary graphs
Word-representability of graphs with respect to split recomposition
The graphs that have antivoltages using groups of small order
Jordan-like characterization of automorphism groups of planar graphs
A \(k\)-structure generalization of the theory of 2-structures
Two disjoint negative cycles in a signed graph
Nonseparating Cocircuits in Binary Matroids
Many 2-level polytopes from matroids
Decomposition of k-ary relations
On separability: Functional structure
Hepp's bound for Feynman graphs and matroids
Connectivity of submodular functions
Treelike comparability graphs
Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\)
On the Complexity of Matroid Isomorphism Problems
Decomposition of wheel-and-parachute-free balanced bipartite graphs
Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs
Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs
Spined categories: generalizing tree-width beyond graphs

This page was built for publication: A Combinatorial Decomposition Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3884147)