𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper bounds on the edge clique cover number of a graph

✍ Scribed by Robert C. Brigham; Ronald D. Dutton

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
521 KB
Volume
52
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

New bounds on the edge number of a k-map
New bounds on the edge number of a k-map graph
✍ Zhi-Zhong Chen πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 310 KB πŸ‘ 1 views

## Abstract It is known that for every integer __k__ β‰₯ 4, each __k__‐map graph with __n__ vertices has at most __kn__ βˆ’ 2__k__ edges. Previously, it was open whether this bound is tight or not. We show that this bound is tight for __k__ = 4, 5. We also show that this bound is not tight for large en

On the number of distinct minimal clique
On the number of distinct minimal clique partitions and clique covers of a line graph
✍ Sean McGuinness; Rolf Rees πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 812 KB

Let G be a line graph. Orlin determined the clique covering and clique partition numbers cc(G) and cp(G). We obtain a constructive proof of Orlin's result and in doing so we are able to completely enumerate the number of distinct minimal clique covers and partitions of G, in terms of easily calculab

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