scientific article
From MaRDI portal
Publication:3999620
zbMath0727.90044MaRDI QIDQ3999620
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Linear programming (90C05) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Structural characterization of families of graphs (05C75) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Combinatorial aspects of packing and covering (05B40)
Related Items (17)
Projective-planar signed graphs and tangled signed graphs ⋮ Decompositions of signed-graphic matroids ⋮ Even-cycle decompositions of graphs with no odd-\(K_4\)-minor ⋮ On combinatorial properties of binary spaces ⋮ Packing Signatures in Signed Graphs ⋮ Signed graphs whose signed Colin de Verdière parameter is two ⋮ On claw-free \(t\)-perfect graphs ⋮ Biased graphs IV: Geometrical realizations ⋮ Displaying blocking pairs in signed graphs ⋮ On ideal clutters, metrics and multiflows ⋮ The minimal \(\mathbb{Z}_n\)-symmetric graphs that are not \(\mathbb{Z}_n\)-spherical ⋮ On perturbations of highly connected dyadic matroids ⋮ Paintshop, odd cycles and necklace splitting ⋮ Coloring graphs with no \(\text{odd-}K_4\) ⋮ Strong orientations without even directed circuits ⋮ A characterization of weakly bipartite graphs ⋮ Tight Cycle Relaxations for the Cut Polytope
This page was built for publication:
