𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Clique covering of graphs

✍ Scribed by L. Pyber

Book ID
110564313
Publisher
Springer-Verlag
Year
1986
Tongue
English
Weight
267 KB
Volume
6
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Asymptotic Clique Covering Ratios of Dis
Asymptotic Clique Covering Ratios of Distance Graphs
✍ Daphne D.-F Liu; Xuding Zhu πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 126 KB

Given a finite set D of positive integers, the distance graph G(Z , D) has Z as the vertex set and {i j : |i -j| ∈ D} as the edge set. Given D, the asymptotic clique covering ratio is defined as S(D) = lim sup nβ†’βˆž n cl(n) , where cl(n) is the minimum number of cliques covering any consecutive n vert

Covering all cliques of a graph
Covering all cliques of a graph
✍ Zsolt Tuza πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 701 KB

The following conjecture of T. Gallai is proved: If G is a chordal graph on n vertices, such that all its maximal complete subgraphs have order at least 3, then there is a vertex set of cardinality ~n/3 which meets all maximal complete subgraphs of G. Further related results are given.

Clique Vertex Magic Cover of a Graph
Clique Vertex Magic Cover of a Graph
✍ K. A. Sugeng; J. Ryan πŸ“‚ Article πŸ“… 2011 πŸ› Springer-Verlag 🌐 English βš– 312 KB