𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Packing Triangles inK4-Free Graphs

✍ Scribed by Shunchang Huang, Lingsheng Shi

Book ID
120788838
Publisher
Springer Japan
Year
2013
Tongue
English
Weight
155 KB
Volume
30
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Packing and covering triangles in graphs
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