✦ LIBER ✦

Packing Triangles in Regular Tournaments

✍ Scribed by Raphael Yuster

Book ID: 115558803
Publisher: John Wiley and Sons
Year: 2012
Tongue: English
Weight: 490 KB
Volume: 74
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.21691

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing and covering triangles in graphs

✍ P.E. Haxell 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 184 KB

It is shown that if G is a graph such that the maximum size of a set of pairwise edge-disjoint triangles is v(G), then there is a set C of edges of G of size at most (3 -e)v(G) such that E(T) N C 7~ 0 for every triangle T of G, where e> 3. This is the first nontrivial bound known for a long-standing

Packing triangles in bounded degree grap

Packing triangles in bounded degree graphs

✍ Alberto Caprara; Romeo Rizzi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 103 KB

We consider the two problems of finding the maximum number of node disjoint triangles and edge disjoint triangles in an undirected graph. We show that the first (respectively second) problem is polynomially solvable if the maximum degree of the input graph is at most 3 (respectively 4), whereas it i

Vertex-disjoint cycles in regular tourna

Vertex-disjoint cycles in regular tournaments

✍ Nicolas Lichiardopol 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 210 KB

Packing and Covering Triangles in Tripar

Packing and Covering Triangles in Tripartite Graphs

✍ Sarmad Abbasi 📂 Article 📅 1998 🏛 Springer Japan 🌐 English ⚖ 91 KB

Packing and Covering Triangles in Planar

Packing and Covering Triangles in Planar Graphs

✍ Qing Cui; Penny Haxell; Will Ma 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 228 KB

Packing Transitive Triples in a Tourname

Packing Transitive Triples in a Tournament

✍ Mohamad Kabiya; Raphael Yuster 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 271 KB