✦ LIBER ✦

Coverings and matchings of the vertices of a graph by the edges

✍ Scribed by G.Ts. Akopyan

Publisher: Elsevier Science
Year: 1974
Weight: 706 KB
Volume: 14
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(74)90050-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Covering the Edges of a Connected Graph

Covering the Edges of a Connected Graph by Paths

✍ L. Pyber 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 316 KB

We prove that every connected graph on n vertices can be covered by at most nÂ2+O(n 3Â4 ) paths. This implies that a weak version of a well-known conjecture of Gallai is asymptotically true.

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

Path coverings of the vertices of a tree

✍ Peter J. Slater 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 840 KB

Consider a collection of disjoint paths in graph G such that every vertex is on one of these paths. The size of the smallest such collection is denoted i(G). A procedure for forming such collections is established. Restricting attention to trees, the range of values for the sizes of the collections

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

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.