𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Largest Graceful Subgraph of the Complete Graph

✍ Scribed by Solomon W. Golomb

Book ID
121212737
Publisher
Mathematical Association of America
Year
1974
Tongue
English
Weight
315 KB
Volume
81
Category
Article
ISSN
0002-9890

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Largest sparse subgraphs of random graph
Largest sparse subgraphs of random graphs
✍ Nikolaos Fountoulakis; Ross J. Kang; Colin McDiarmid πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 184 KB
Largest sparse subgraphs of random graph
Largest sparse subgraphs of random graphs
✍ Fountoulakis, Nikolaos; Kang, Ross J.; McDiarmid, Colin πŸ“‚ Article πŸ“… 2014 πŸ› Elsevier Science 🌐 English βš– 410 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