𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Clique-critical graphs: Maximum size and recognition

✍ Scribed by Liliana Alcón

Book ID
108112591
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
143 KB
Volume
154
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A generalization of chordal graphs and t
A generalization of chordal graphs and the maximum clique problem
✍ Assef Chmeiss; Philippe Jégou 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 584 KB

A graph is chordal or triangulated if it has no chordless cycle with four or more vertices. Chordal graphs are well known for their combinatorial and algorithmic properties. Here we introduce a generalization of chordal graphs, namely CSGk graphs. Informally, a CSG' graph is a complete graph, and fo