A Combinatorial Decomposition Theory

Cited In (only showing first 100 items - show all)

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

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)