✦ LIBER ✦

Partitions of graphs into coverings and hypergraphs into transversals

✍ Scribed by D. de Werra

Book ID: 112783254
Publisher: European Mathematical Society
Year: 1974
Tongue: English
Weight: 237 KB
Volume: 49
Category: Article
ISSN: 0010-2571
DOI: 10.1007/bf02566726

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitions of Graphs into Cographs

✍ John Gimbel; Jaroslav Nes̆etr̆il 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 629 KB

On partitions of graphs into trees

✍ F.R.K. Chung 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 934 KB

We crgnsider the minimum m\*-nber T(G) of subsets intl:, which the edge set E(G) of a graph G can lx partitioned so that each subset forms a tree. It is shown that for any connected (3 with II vertices, we always have T( Gj s [$I.

Clique coverings and partitions of line

Clique coverings and partitions of line graphs

✍ Bo-Jr Li; Gerard J. Chang 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 153 KB

Total domination of graphs and small tra

Total domination of graphs and small transversals of hypergraphs

✍ Stéphan Thomassé; Anders Yeo 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 216 KB

Chromatic numbers of hypergraphs and cov

Chromatic numbers of hypergraphs and coverings of graphs

✍ Zevi Miller; Heinrich Müller 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 284 KB

Burr recently proved [3] that for positive integers m , , m 2 , . . , , m, and any graph G we have x(G) 5 &, if and only if G can be expressed as the edge disjoint union of subgraphs F, satisfying x(F,) 5 m,. This theorem is generalized to hypergraphs. By suitable interpretations the generalization

Partitions of graphs into small and larg

Partitions of graphs into small and large sets

✍ Bojilov, Asen; Caro, Yair; Hansberg, Adriana; Nenov, Nedyalko 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 453 KB