✦ LIBER ✦

Packing and covering of the complete graph with a graph G of four vertices or less

✍ Scribed by Y Roditty

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 551 KB
Volume: 34
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(83)90058-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Covering the cliques of a graph with ver

Covering the cliques of a graph with vertices

✍ Paul Erdős; Tibor Gallai; Zsolt Tuza 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 681 KB

The following problem is investigated. Given an undirected graph G, determine the smallest cardinality of a vertex set that meets all complete subgraphs KC G maximal under inclusion.

Matching and covering the vertices of a

Matching and covering the vertices of a random graph by copies of a given graph

✍ Andrzej Ruciński 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 747 KB

## Rucidski, A., Matching and covering the vertices of a random graph by copies of a given graph, Discrete Mathematics 105 (1992) 185-197. In this paper we partially answer the question: how slowly must p(n) converge to 0 so that a random graph K(n, p) has property PM, almost surely, where PM, me

Coverings of the complete (di-)graph wit

Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices I

✍ Hans-Dietrich O.F. Gronau 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 519 KB

Covering the vertices of a graph by cycl

Covering the vertices of a graph by cycles of prescribed length

✍ D. Amar; I. Fournier; A. Germa 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB

The main theorem of that paper is the following: let G be a graph of order n, of size at least (nZ -3n + 6 ) / 2 . For any integers k, n,, n2,. . . , nk such that n = n, + n2 + ... + nk and n, 2 3, there exists a covering of the vertices of G by disjoint cycles (C,),=,..,k with ICjl = n,, except whe

Coloring the Edges of a Complete Graph

✍ Annamaria G. Varga 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 577 KB

Packing a tree with a graph of the same

Packing a tree with a graph of the same size

✍ P. J. Slater; S. K. Teo; H. P. Yap 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB

## Abstract We prove that if __T__ is a tree of order __p__ ⩾ 5 and __G__ is a graph of order __p__ and size __p__ ‐ 1 such that neither __T__ nor __G__ is a star, then __T__ can be embedded in G, the complement of __G__.