| Publication | Date of Publication | Type |
|---|
Vertex-critical (P₅, W₄)-free graphs
Theoretical Computer Science | 2026-05-11 | Paper |
An approximation algorithm for zero forcing
Discrete Applied Mathematics | 2026-02-24 | Paper |
| Vertex-critical (P₅,W₄)-free graphs | 2026-01-28 | Paper |
Vertex-critical graphs in co-gem-free graphs
Theoretical Computer Science | 2025-05-13 | Paper |
| On the finiteness of k-vertex-critical 2P₂-free graphs with forbidden induced squids or bulls | 2025-02-28 | Paper |
A tight upper bound on the average order of dominating sets of a graph
Journal of Graph Theory | 2024-11-24 | Paper |
Cut-down de Bruijn sequences
Discrete Mathematics | 2024-11-09 | Paper |
Pivot Gray codes for the spanning trees of a graph ft. the fan
Graphs and Combinatorics | 2024-07-29 | Paper |
Infinite families of \(k\)-vertex-critical \((P_5, C_5)\)-free graphs
Graphs and Combinatorics | 2024-03-26 | Paper |
Vertex-critical ( P₃ + P₁ )-free and vertex-critical (gem, co-gem)-free graphs
Discrete Applied Mathematics | 2023-12-22 | Paper |
The node cop‐win reliability of unicyclic and bicyclic graphs
Networks | 2023-12-11 | Paper |
On the mean subtree order of graphs under edge addition
Journal of Graph Theory | 2023-09-29 | Paper |
A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs
Theoretical Computer Science | 2023-05-23 | Paper |
A pivot Gray code listing for the spanning trees of the fan graph
(available as arXiv preprint) | 2023-03-30 | Paper |
Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality
Algorithmica | 2023-03-09 | Paper |
| A Tight Upper Bound on the Average Order of Dominating Sets of a Graph | 2022-08-22 | Paper |
| Cut-Down de Bruijn Sequences | 2022-05-05 | Paper |
Dichotomizing \(k\)-vertex-critical \(H\)-free graphs for \(H\) of order four
Discrete Applied Mathematics | 2022-03-24 | Paper |
A Hamilton cycle in the \(k\)-sided pancake network
(available as arXiv preprint) | 2022-03-22 | Paper |
| Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan | 2022-02-03 | Paper |
A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph
(available as arXiv preprint) | 2021-08-20 | Paper |
A Hamilton Cycle in the k-Sided Pancake Network
(available as arXiv preprint) | 2021-03-16 | Paper |
A note on purely imaginary independence roots
Discrete Mathematics | 2020-10-08 | Paper |
Dichotomizing k-vertex-critical H-free graphs for H of order four
(available as arXiv preprint) | 2020-06-30 | Paper |
| On the largest real root of the independence polynomial of a unicyclic graph | 2020-06-09 | Paper |
Maximum modulus of independence roots of graphs and trees
Graphs and Combinatorics | 2020-04-30 | Paper |
| Independence equivalence classes of paths and cycles | 2019-12-19 | Paper |
Independence equivalence classes of paths and cycles
(available as arXiv preprint) | 2019-12-19 | Paper |
On the stability of independence polynomials
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
On the stability of independence polynomials
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
On the unimodality of independence polynomials of very well-covered graphs
Discrete Mathematics | 2018-02-23 | Paper |
| Edge contraction and cop-win critical graphs | 2015-11-16 | Paper |
An approximation algorithm for zero forcing
(available as arXiv preprint) | N/A | Paper |
On the finiteness of k-vertex-critical 2P₂-free graphs with forbidden induced squids or bulls
(available as arXiv preprint) | N/A | Paper |
