27 citations · 87 across the 27 of their papers we have counts for
Showing 2013 · math.COShow all
2 papers · 2 filters
math.CO2013★ 3 cited
On a Conjecture of Erdős, Gallai, and Tuza
Gregory J. Puleo
Erdős, Gallai, and Tuza posed the following problem: given an -vertex graph , let denote the smallest size of a set of edges whose deletion makes triangle-free,…
math.CO2013★ 27 cited
Tuza's Conjecture for Graphs of Maximum Average Degree Less Than 7
Gregory J. Puleo
Tuza's Conjecture states that if a graph does not contain more than edge-disjoint triangles, then some set of at most edges meets all triangles of . We prove Tuza's…