The polyhedron of a problem on an m-vertex subgraph of a complete graph

DOI10.1016/0041-5553(84)90057-0zbMath0566.05035OpenAlexW2011637610MaRDI QIDQ3680860

S. N. Greshnev

Publication date: 1984

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(84)90057-0

zbMATH Keywords

convex polyhedroncomplete graph with weighted edges

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Polytopes and polyhedra (52Bxx)

Related Items (1)

On random 2-adjacent 0/1-polyhedra

This page was built for publication: The polyhedron of a problem on an m-vertex subgraph of a complete graph