A Combinatorial Decomposition Theory

Cited in

(only showing first 100 items - show all)

Connectivity of submodular functions
Two disjoint negative cycles in a signed graph
The family of bicircular matroids closed under duality
Basic perfect graphs and their extensions
A decomposition theory for matroids. V: Testing of matrix total unimodularity
Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs
On the second homology of planar graph braid groups
Partitive hypergraphs
1-intersecting families
Local convergence of random planar graphs
On chains of 3-connected matroids
The incidence structure of subspaces with well-scaled frames
Jordan-like characterization of automorphism groups of planar graphs
Hepp's bound for Feynman graphs and matroids
On testing consecutive-ones property in parallel
Forbidden subgraphs and graph decomposition
Circle graph isomorphism in almost linear time
Decomposing infinite matroids into their 3-connected minors
Edge bipartization faster than \(2^k\)
Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs
Distance-hereditary comparability graphs
On computing the Gromov hyperbolicity
Digraph Decompositions and Eulerian Systems
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
A matroid invariant via the K-theory of the Grassmannian
Decomposition of 3-connected representable matroids
Decomposition of 3-connected cubic graphs
Tree pivot-minors and linear rank-width
Cluster editing: kernelization based on edge cuts
Cluster editing: kernelization based on edge cuts
The structure of the 3-separations of 3-connected matroids
N-free posets as generalizations of series-parallel posets
The graphs that have antivoltages using groups of small order
The Tutte polynomial of a ported matroid
Axioms for infinite matroids
The structure of the 4-separations in 4-connected matroids
Tree-representation of set families and applications to combinatorial decompositions
Decomposition of Directed Graphs
The structure of 3-connected matroids of path width three
The structure of the 3-separations of 3-connected matroids. II.
The structure of 2-separations of infinite matroids
Reconstruction of infinite matroids from their 3-connected minors
Detecting 2-joins faster
Decomposition of 3-connected graphs
Constructive characterizations of 3-connected matroids of path width three
Hamilton cycles in plane triangulations
Graph decompositions definable in monadic second-order logic
Minimum cuts and sparsification in hypergraphs
A Representation Theorem for Union-Difference Families and Application
Stability, fragility, and Rota's conjecture
Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
Graph theory. Abstracts from the workshop held January 2--8, 2022
Separating cocircuits in binary matroids
Counting labelled three-connected and homeomorphically irreducible two- connected graphs
Connected hyperplanes in binary matroids
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
On separability: Functional structure
The arborescence-realization problem
Decomposition of submodular functions
On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
A decomposition theory for matroids. I: General results
An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs
Subdivisional spaces and graph braid groups
A separation decomposition for orders
The graph sandwich problem for 1-join composition is NP-complete
Completely separable graphs
The structure of crossing separations in matroids
On complexities of minus domination
Hamiltonian properties of polyhedra with few 3-cuts. A survey
Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\)
Knocking out \(P_k\)-free graphs
Hypergraphs with polynomial representation: introducing \(r\)-splits
An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
Characteristics of graph braid groups
Decomposition of wheel-and-parachute-free balanced bipartite graphs
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
Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\)
Tutte polynomials computable in polynomial time
Canonical decompositions of symmetric submodular systems
Minimum balanced bipartitions of planar triangulations
Spined categories: generalizing tree-width beyond graphs
Self-dual graphs
Some remarks on Jaeger's dual-hamiltonian conjecture
Word-representability of graphs with respect to split recomposition
A decomposition of distributive lattices
Practical and efficient split decomposition via graph-labelled trees
Nonseparating Cocircuits in Binary Matroids
Connectivity in bicircular matroids
A supernodal formulation of vertex colouring with applications in course timetabling
Balanced matrices
2-clique-bond of stable set polyhedra
Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs
On the 2-sum in rigidity matroids
A survey of the algorithmic aspects of modular decomposition

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)