Pages that link to "Item:Q3884147"

The following pages link to A Combinatorial Decomposition Theory (Q3884147):

Displaying 50 items.

• An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094) (← links)
• Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\) (Q297920) (← links)
• Bounding and stabilizing realizations of biased graphs with a fixed group (Q345077) (← links)
• Axioms for infinite matroids (Q390757) (← links)
• Tree-representation of set families and applications to combinatorial decompositions (Q412262) (← links)
• Decomposition of 3-connected representable matroids (Q414638) (← links)
• Stability, fragility, and Rota's conjecture (Q414652) (← links)
• Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs (Q415271) (← links)
• A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
• Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
• Computing \(H\)-joins with application to 2-modular decomposition (Q486993) (← links)
• Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431) (← links)
• Ghost symmetry and an analogue of Steinitz's theorem (Q536157) (← links)
• A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
• Two-sided combinatorial volume bounds for non-obtuse hyperbolic polyhedra (Q634724) (← links)
• On the complexity of matroid isomorphism problem (Q639843) (← links)
• The structure of the 4-separations in 4-connected matroids (Q651044) (← links)
• Edge bipartization faster than \(2^k\) (Q666655) (← links)
• Decomposition of 3-connected cubic graphs (Q685673) (← links)
• The decomposition of graphs into \(k\)-connected components (Q686294) (← links)
• Tutte polynomials computable in polynomial time (Q686299) (← links)
• The structure of the 3-separations of 3-connected matroids (Q705882) (← links)
• Hamiltonian properties of polyhedra with few 3-cuts. A survey (Q724894) (← links)
• Decomposition of k-ary relations (Q751668) (← links)
• Canonical decompositions of symmetric submodular systems (Q760444) (← links)
• A decomposition theory for matroids. I: General results (Q801076) (← links)
• The structure of 3-connected matroids of path width three (Q872056) (← links)
• The structure of the 3-separations of 3-connected matroids. II. (Q875060) (← links)
• The structure of 2-separations of infinite matroids (Q895994) (← links)
• Many 2-level polytopes from matroids (Q908212) (← links)
• Completely separable graphs (Q908944) (← links)
• Decomposition of partial orders (Q919013) (← links)
• The structure of crossing separations in matroids (Q928774) (← links)
• Constructive characterizations of 3-connected matroids of path width three (Q942135) (← links)
• \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
• Rigidity, global rigidity, and graph decomposition (Q973100) (← links)
• A matroid invariant via the \(K\)-theory of the Grassmannian (Q1018421) (← links)
• Structure and enumeration of two-connected graphs with prescribed three-connected components (Q1023394) (← links)
• Treelike comparability graphs (Q1026130) (← links)
• Decomposition of submodular functions (Q1053717) (← links)
• A decomposition of distributive lattices (Q1057293) (← links)
• 1-intersecting families (Q1062056) (← links)
• Connectivity in bicircular matroids (Q1070236) (← links)
• On chains of 3-connected matroids (Q1086571) (← links)
• N-free posets as generalizations of series-parallel posets (Q1097286) (← links)
• A decomposition theory for matroids. V: Testing of matrix total unimodularity (Q1103625) (← links)
• The incidence structure of subspaces with well-scaled frames (Q1110520) (← links)
• Counting labelled three-connected and homeomorphically irreducible two- connected graphs (Q1147157) (← links)
• Counting unlabelled three-connected and homeomorphically irreducible two- connected graphs (Q1147158) (← links)
• Partitive hypergraphs (Q1160636) (← links)