✦ LIBER ✦

Computing the boxicity of a graph by covering its complement by cointerval graphs

✍ Scribed by Margaret B. Cozzens; Fred S. Roberts

Book ID: 104182746
Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 764 KB
Volume: 6
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(83)90077-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The connectivity of a graph and its comp

The connectivity of a graph and its complement

✍ Angelika Hellwig; Lutz Volkmann 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 322 KB

Covering the edges of a graph by circuit

Covering the edges of a graph by circuits

✍ D. Ya. Kesel'man 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 847 KB

Graphs defined by coverings of a set

✍ R. K. Guy; E. C. Milner 📂 Article 📅 1968 🏛 Akadmiai Kiad 🌐 English ⚖ 703 KB

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 random graph by

Covering the edges of a random graph by cliques

✍ Alan Frieze; Bruce Reed 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 267 KB

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.