✦ LIBER ✦

The clique problem for planar graphs

✍ Scribed by Christos H. Papadimitriou; Mihalis Yannakakis

Book ID: 113162319
Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 326 KB
Volume: 13
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(81)90041-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Clique Planar Graphs

✍ Liliana Alcón; Marisa Gutierrez 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 278 KB

Hard graphs for the maximum clique probl

Hard graphs for the maximum clique problem

✍ Cornelis Hoede 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 299 KB

Cliques and extended triangles. A necess

Cliques and extended triangles. A necessary condition for planar clique graphs

✍ Liliana Alcón; Marisa Gutierrez 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 256 KB

By generalizing the idea of extended triangle of a graph, we succeed in obtaining a common framework for the result of Roberts and Spencer about clique graphs and the one of Szwarcÿter about Helly graphs. We characterize Helly and 3-Helly planar graphs using extended triangles. We prove that if a pl

The densestk-subgraph problem on clique

The densestk-subgraph problem on clique graphs

✍ Maria Liazi; Ioannis Milis; Fanny Pascual; Vassilis Zissimopoulos 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 294 KB

The difference between clique graphs and

The difference between clique graphs and iterated clique graphs

✍ Pablo De Caria 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 280 KB

The max clique problem in classes of str

The max clique problem in classes of string-graphs

✍ M. Middendorf; F. Pfeiffer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 378 KB

Middendorf, M., F. Pfeiffer, The max clique problem in classes of string-graphs, Discrete Mathematics 108 (1992) 365-372. A string-graph is an intersection graph of a set of curves in the plane. Investigating the complexity of the max clique problem for some classes of string-graphs we obtain NPcomp