𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Number of Graphs on N VERTICES WITH 3 CLIQUES

✍ Scribed by Reid, K. B.

Book ID
120096942
Publisher
Oxford University Press
Year
1974
Tongue
English
Weight
92 KB
Volume
s2-8
Category
Article
ISSN
0024-6107

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Covering the cliques of a graph with ver
Covering the cliques of a graph with vertices
✍ Paul ErdΕ‘s; Tibor Gallai; Zsolt Tuza πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 681 KB

The following problem is investigated. Given an undirected graph G, determine the smallest cardinality of a vertex set that meets all complete subgraphs KC G maximal under inclusion.

On the Ramsey number of trees versus gra
On the Ramsey number of trees versus graphs with large clique number
✍ Ronald J. Gould; Michael S. Jacobson πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 335 KB

Chvatal established that r(T,, K,,) = (m -1 ) ( n -1 ) + 1, where T, , , is an arbitrary tree of order m and K, is the complete graph of order n. This result was extended by Chartrand, Gould, and Polimeni who showed K, could be replaced by a graph with clique number n and order n + 5 provided n 2 3

On local connectivity of graphs with giv
On local connectivity of graphs with given clique number
✍ Andreas Holtkamp; Lutz Volkmann πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 72 KB

## Abstract For a vertex __v__ of a graph __G__, we denote by __d__(__v__) the __degree__ of __v__. The __local connectivity__ ΞΊ(__u, v__) of two vertices __u__ and __v__ in a graph __G__ is the maximum number of internally disjoint __u__ –__v__ paths in __G__, and the __connectivity__ of __G__ is