๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Thep-intersection number of a complete bipartite graph and orthogonal double coverings of a clique

โœ Scribed by Myung S. Chung; Douglas B. West

Publisher
Springer-Verlag
Year
1994
Tongue
English
Weight
588 KB
Volume
14
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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