✦ LIBER ✦

The perfectly Matchable Subgraph Polytope of an arbitrary graph

✍ Scribed by E. Balas; W. R. Pulleyblank

Publisher: Springer-Verlag
Year: 1989
Tongue: English
Weight: 942 KB
Volume: 9
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02125345

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On separation and adjacency problems for

On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph

✍ Ning Qi 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 296 KB

Complete subgraphs of the graphs of conv

Complete subgraphs of the graphs of convex polytopes

✍ S. Gallivan; E.R. Lockeberg; P. McMullen 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 631 KB

It is shown that if three vertices of the graph c?(l)) of a convex 3-polytope P are chosen, then G(P) contains a refinement of the complete graph C,, on four vertices, for which the three chosen vertices are principal (that is, correspond to vertices of C, in the refinement.. In general, all four ve

The graph of an abstract polytope

✍ Katta G. Murty 📂 Article 📅 1973 🏛 Springer-Verlag 🌐 English ⚖ 585 KB

The dominant of the 2-connected-Steiner-

The dominant of the 2-connected-Steiner-subgraph polytope for W4-free graphs

✍ Collette R Coullard; Abdur Rais; Ronald L Rardin; Donald K Wagner 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 789 KB

The polyhedron of a problem on an m-vert

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

✍ S.N. Greshnev 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 249 KB

The path set polytope of an acyclic, dir

The path set polytope of an acyclic, directed graph with an application to machine sequencing

✍ John H. Vande Vate 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 393 KB