✦ LIBER ✦

Packing and Covering Triangles in Planar Graphs

✍ Scribed by Qing Cui; Penny Haxell; Will Ma

Publisher: Springer Japan
Year: 2009
Tongue: English
Weight: 228 KB
Volume: 25
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-010-0881-5

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 and Covering Triangles in Tripar

Packing and Covering Triangles in Tripartite Graphs

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

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

Packing and covering dense graphs

✍ Noga Alon; Yair Caro; Raphael Yuster 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 498 KB 👁 1 views

Packing paths in planar graphs

✍ András Frank 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 355 KB

Edge-Packing in Planar Graphs

✍ L. S. Heath; J. P. C. Vergara 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 396 KB