Gregory J. Puleo

activity

20112023

most citedTuza's Conjecture for Graphs of Maximum Average Degree Less Than 7

27 citations · 87 across the 27 of their papers we have counts for

collaborators

Showing 2014 · math.COShow all

5 papers · 2 filters

math.CO2014★ 1 cited

Extremal Aspects of the Erdős--Gallai--Tuza Conjecture

Gregory J. Puleo

Erdős, Gallai, and Tuza posed the following problem: given an $n$ -vertex graph $G$ , let $τ_{1} (G)$ denote the smallest size of a set of edges whose deletion makes $G$ triangle-free,…

math.CO2014

Extension from Precoloured Sets of Edges

Katherine Edwards, António Girão, Jan van den Heuvel +3

We consider precolouring extension problems for proper edge-colourings of graphs and multigraphs, in an attempt to prove stronger versions of Vizing's and Shannon's bounds on the c…

math.CO2014★ 1 cited

Favaron's Theorem, k-dependence, and Tuza's Conjecture

Gregory J. Puleo

A vertex set $D$ in a graph $G$ is $k$ -dependent if $G [D]$ has maximum degree at most $k - 1$ , and $k$ -dominating if every vertex outside $D$ has at least $k$ neighbors in $D$ . Favar…

math.CO2014★ 3 cited

On (4,2)-Choosable Graphs

Jixian Meng, Gregory J. Puleo, Xuding Zhu

A graph $G$ is called $(a, b)$ -choosable if for any list assignment $L$ which assigns to each vertex $v$ a set $L (v)$ of $a$ permissible colours, there is a $b$ -tuple $L$ -colouring…

math.CO2014

Choosability with Separation in Complete Multipartite Graphs

Gregory J. Puleo

We show that there is a constant $k$ such that when $r \geq 2$ and $m \geq r^{k}$ , the complete $r$ -partite graph $K_{m * r}$ has a non-colorable list assignment $L$ such that $|L(v)|…