𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Enumeration of Maximal Cliques of Large Graphs

✍ Scribed by Akkoyunlu, E. A.

Book ID
118145719
Publisher
Society for Industrial and Applied Mathematics
Year
1973
Tongue
English
Weight
472 KB
Volume
2
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Coloring the Maximal Cliques of Graphs
Coloring the Maximal Cliques of Graphs
✍ BacsΓ³, GΓ‘bor; Gravier, Sylvain; GyΓ‘rfΓ‘s, AndrΓ‘s; Preissmann, Myriam; Sebo, AndrΓ‘ πŸ“‚ Article πŸ“… 2004 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 195 KB
Maximal cliques in the Paley graph of sq
Maximal cliques in the Paley graph of square order
✍ R.D. Baker; G.L. Ebert; J. Hemmeter; A. Woldar πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 424 KB

Determining the clique number of the Paley graph of order q, 4 E I (mod 4) a prime power, is a difficult problem. However, the work of Blokhuis implies that in the Paley graph of order q2, where q is any odd prime power, the clique number is in fact q. In this paper we construct maximal cliques of s

The maximal clique and colourability of
The maximal clique and colourability of curve contact graphs
✍ Petr HlineΛ‡nΓ½ πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 669 KB

## Contact graphs are a special kind of intersection graphs of geometrical objects in which the objects are not allowed to cross but only to touch each other. Contact graphs of simple curves, and line segments as a special case, in the plane are considered. The curve contact representations are st