27 citations · 87 across the 27 of their papers we have counts for
7 papers · 1 filter
Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds
Gregory J. Puleo, Olgica Milenkovic
We consider the problem of correlation clustering on graphs with constraints on both the cluster sizes and the positive and negative weights of edges. Our contributions are twofold…
Codes for DNA Storage Channels
Han Mao Kiah, Gregory J. Puleo, Olgica Milenkovic
We consider the problem of assembling a sequence based on a collection of its substrings observed through a noisy channel. The mathematical basis of the problem is the construction…
Extremal Aspects of the Erdős--Gallai--Tuza Conjecture
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,…
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…
Favaron's Theorem, k-dependence, and Tuza's Conjecture
Gregory J. Puleo
A vertex set in a graph is -dependent if has maximum degree at most , and -dominating if every vertex outside has at least neighbors in . Favar…
On (4,2)-Choosable Graphs
Jixian Meng, Gregory J. Puleo, Xuding Zhu
A graph is called -choosable if for any list assignment which assigns to each vertex a set of permissible colours, there is a -tuple -colouring…