✦ LIBER ✦

Packing and Covering Triangles inK4-free Planar Graphs

✍ Scribed by Penny Haxell, Alexandr Kostochka, Stéphan Thomassé

Book ID: 118783093
Publisher: Springer Japan
Year: 2011
Tongue: English
Weight: 233 KB
Volume: 28
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-011-1071-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing Triangles inK4-Free Graphs

✍ Shunchang Huang, Lingsheng Shi 📂 Article 📅 2013 🏛 Springer Japan 🌐 English ⚖ 155 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 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 and covering dense graphs

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

Triangle-free partial graphs and edge co

Triangle-free partial graphs and edge covering theorems

✍ J. Lehel; Zs. Tuza 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 722 KB

In Section 1 some lower bounds are given for the maximal number of edges of a (p -l)colorable partial graph. Among others we show that a graph on n vertices with m edges has a (p -l)-colorable partiai graph with at least mT,.$(;) edges, where T,,p denotes the so called Turin number. These results ar