A Combinatorial Decomposition Theory

Cited in

(only showing first 100 items - show all)

A matroid invariant via the K-theory of the Grassmannian
Structure and enumeration of two-connected graphs with prescribed three-connected components
Treelike comparability graphs
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
3-connected reduction for regular graph covers
Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
On complexities of minus domination
Cluster editing: kernelization based on edge cuts
Distance-hereditary comparability graphs
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
Characteristics of graph braid groups
On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems
An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
Characterizing matroids whose bases form graphic delta-matroids
The family of bicircular matroids closed under duality
Compositions for perfect graphs
On the 2-sum in rigidity matroids
Minimum balanced bipartitions of planar triangulations
Subdivisional spaces and graph braid groups
The graphs that have antivoltages using groups of small order
Knocking out \(P_k\)-free graphs
Decomposition of 3-connected graphs
Detecting 2-joins faster
Reconstruction of infinite matroids from their 3-connected minors
On polygon numbers of circle graphs and distance hereditary graphs
Balanced matrices
2-clique-bond of stable set polyhedra
The structure of equivalent 3-separations in a 3-connected matroid
Local 2-separators
Jordan-like characterization of automorphism groups of planar graphs
Graph theory. Abstracts from the workshop held January 2--8, 2022
Local convergence of random planar graphs
Hepp's bound for Feynman graphs and matroids
On computing the Gromov hyperbolicity
Unifying the representation of symmetric crossing families and weakly partitive families
Decomposing infinite matroids into their 3-connected minors
An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs
Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\)
Cluster editing: kernelization based on edge cuts
On the Complexity of Matroid Isomorphism Problems
Graph decompositions definable in monadic second-order logic
Two disjoint negative cycles in a signed graph
Bounding and stabilizing realizations of biased graphs with a fixed group
Digraph Decompositions and Eulerian Systems
Forbidden subgraphs and graph decomposition
Axioms for infinite matroids
Decomposition of Directed Graphs
Tree-representation of set families and applications to combinatorial decompositions
Decomposition of 3-connected representable matroids
Stability, fragility, and Rota's conjecture
Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
A separation decomposition for orders
Minimum cuts and sparsification in hypergraphs
A survey of the algorithmic aspects of modular decomposition
Practical and efficient split decomposition via graph-labelled trees
Hamilton cycles in plane triangulations
Computing \(H\)-joins with application to 2-modular decomposition
Tree pivot-minors and linear rank-width
Nonseparating Cocircuits in Binary Matroids
Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs
Ghost symmetry and an analogue of Steinitz's theorem
A Representation Theorem for Union-Difference Families and Application
Connected hyperplanes in binary matroids
Graph isomorphism restricted by lists
A polynomial kernel for distance-hereditary vertex deletion
Spined categories: generalizing tree-width beyond graphs
On the second homology of planar graph braid groups
A supernodal formulation of vertex colouring with applications in course timetabling
Circle graph isomorphism in almost linear time
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)