𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Large Cliques in-Free Graphs

✍ Scribed by András Gyárfás; Alice Hubenko; József Solymosi

Publisher
Springer-Verlag
Year
2002
Tongue
English
Weight
130 KB
Volume
22
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding a large hidden clique in a rando
Finding a large hidden clique in a random graph
✍ Noga Alon; Michael Krivelevich; Benny Sudakov 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB

We consider the following probabilistic model of a graph on n labeled vertices. ## Ž . First choose a random graph G n, 1r2 , and then choose randomly a subset Q of vertices of size k and force it to be a clique by joining every pair of vertices of Q by an edge. The problem is to give a polynomia

Dominating cliques in chordal graphs
Dominating cliques in chordal graphs
✍ Dieter Kratsch; Peter Damaschke; Anna Lubiw 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 492 KB

A chordal graph has a dominating clique iff it has diameter at most 3. A strongly chordal graph which has a dominating clique has one as small as the smallest dominating set-and, furthermore, there is a linear-time algorithm to find such a small dominating clique.