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

37 papers

math.CO2023

Slow Coloring of 3k-Connected Graphs

Joan Morris, Gregory Puleo

The slow coloring game was introduced by Mahoney, Puleo, and West and it is played by two players, Lister and Painter, on a graph $G$. In round $i$, Lister marks a nonempty sub…

math.CO2020

A lower bound on the saturation number, and graphs for which it is sharp

Alex Cameron, Gregory J. Puleo

Let $H$ be a fixed graph. We say that a graph $G$ is $H$ -saturated if it has no subgraph isomorphic to $H$ , but the addition of any edge to $G$ results in an $H$ -subgraph. The satu…

math.CO2020

Strong coloring 2-regular graphs: Cycle restrictions and partial colorings

Jessica McDonald, Gregory J. Puleo

Let $H$ be a graph with $Δ (H) \leq 2$ , and let $G$ be obtained from $H$ by gluing in vertex-disjoint copies of $K_{4}$ . We prove that if $H$ contains at most one odd cycle of length…

math.CO2019★ 4 cited

Upper bounds for inverse domination in graphs

Elliot Krop, Jessica McDonald, Gregory J. Puleo

In any graph $G$ , the domination number $γ (G)$ is at most the independence number $α (G)$ . The Inverse Domination Conjecture says that, in any isolate-free $G$ , there exists pair of…

math.CO2019

Some results on multithreshold graphs

Gregory J. Puleo

Jamison and Sprague defined a graph $G$ to be a $k$ -threshold graph with thresholds $θ_{1}, \dots, θ_{k}$ (strictly increasing) if one can assign real numbers $(r_{v})_{v \in V (G)}$ , c…

cs.DS2018★ 2 cited

Motif and Hypergraph Correlation Clustering

Pan Li, Gregory J. Puleo, Olgica Milenkovic

Motivated by applications in social and biological network analysis, we introduce a new form of agnostic clustering termed~\emph{motif correlation clustering}, which aims to minimi…