✦ LIBER ✦

Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane

✍ Scribed by Hiroshi Imai; Takao Asano

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 732 KB
Volume: 4
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(83)90012-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for a maximum clique of the

An algorithm for a maximum clique of the intersection graph of isooriented rectangles on a cylinder

✍ Takashi Kizu; Toshiro Araki; Toshinobu Kashiwabara 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 624 KB

On the largest tree of given maximum deg

On the largest tree of given maximum degree in a connected graph

✍ Y. Caro; I. Krasikov; Y. Roditty 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB 👁 1 views

## Abstract We prove that every connected graph __G__ contains a tree __T__ of maximum degree at most __k__ that either spans __G__ or has order at least __k__δ(__G__) + 1, where δ(__G__) is the minimum degree of __G.__ This generalizes and unifies earlier results of Bermond [1] and Win [7]. We als

An upper bound on the size of a largest

An upper bound on the size of a largest clique in a graph

✍ Dennis P. Geoffroy; David P. Sumner 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB 👁 1 views

## Abstract A graph is point determining if distinct vertices have distinct neighborhoods. The nucleus of a point‐determining graph is the set __G__^O^ of all vertices, __v__, such that __G__–__v__ is point determining. In this paper we show that the size, ω(__G__), of a maximum clique in __G__ sat