๐”– Bobbio Scriptorium
โœฆ   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

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Complete subgraphs of the graphs of conv
โœ 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