✦ LIBER ✦

The complexity of generalized clique covering

✍ Scribed by D.G. Corneil; J. Fonlupt

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 670 KB
Volume: 22
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(88)90086-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of generalized clique pac

The complexity of generalized clique packing

✍ D.G. Corneil 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 332 KB

Generalized covering designs and clique

Generalized covering designs and clique coverings

✍ Robert F. Bailey; Andrea C. Burgess; Michael S. Cavers; Karen Meagher 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB

Inspired by the "generalized t-designs" defined by Cameron [P. J. Cameron, Discrete Math 309 (2009), 4835-4842], we define a new class of combinatorial designs which simultaneously provide a generalization of both covering designs and covering arrays. We then obtain a number of bounds on the minimu

Clique covering and clique partition in

Clique covering and clique partition in generalizations of line graphs

✍ Erich Prisner 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 387 KB

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

On a clique covering problem of orlin

✍ David A. Gregory; Norman J. Pullman 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 261 KB

Let Tz, be the complement of a perfect matching in the complete ,qraph on 2n vertkes, am; cc(T?,I be the minimum #lumber of complete subgraphs necessary to cover all rhe edge? cf T2,,. Orlin posed the problem of determining the asymptotic behzviour of cc(T,,!. We show that cc( T,,

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.