Packing and Covering Triangles in K 4-free Planar Graphs

  title={Packing and Covering Triangles in K 4-free Planar Graphs},
  author={Penny E. Haxell and Alexandr V. Kostochka and St{\'e}phan Thomass{\'e}},
  journal={Graphs and Combinatorics},
We show that every K4-free planar graph with at most ν edge-disjoint triangles contains a set of at most 32ν edges whose removal makes the graph triangle-free. Moreover, equality is attained only when G is the edge-disjoint union of 5-wheels plus possibly some edges that are not in triangles. We also show that the same statement is true if instead of planar graphs we consider the class of graphs in which each edge belongs to at most two triangles. In contrast, it is known that for any c < 2… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.
Showing 1-9 of 9 references

Conjecture, Finite and Infinite Sets, Eger, Hungary

  • Zs. Tuza
  • Proc. Colloq. Math. Soc. J. Bolyai,
  • 1981
Highly Influential
5 Excerpts

Some Ramsey-type numbers and the independence ratio

  • W. Stanton
  • Trans. Amer. Math. Soc
  • 1979
1 Excerpt

On the size of independent sets in graphs

  • S. Fajtlowicz
  • Congr. Numer
  • 1978
1 Excerpt

Similar Papers

Loading similar papers…