scientific article; zbMATH DE number 3628719

zbMath0404.90060MaRDI QIDQ4190434

Dirk Hausmann

Publication date: 1979

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

GraphsComputational ComplexityAdjacencyB-Matching PolyhedronColoring AlgorithmFeasible Colorings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Integer programming (90C10) Polytopes and polyhedra (52Bxx)

Related Items

Adjacent vertices on the b-matching polyhedron ⋮ Adjacency on polymatroids