D. Cox

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Burning sufficiently large \(p\)-caterpillars for a fixed \(p\) The Australasian Journal of Combinatorics	2026-02-12	Paper
The rhizomic tiles at Shooter’s Hill: an application of Truchet tiles Journal of Mathematics and the Arts	2025-01-24	Paper
Time-delayed cops and robbers Discrete Applied Mathematics	2024-12-04	Paper
Diffusion: quiescence and perturbation The Australasian Journal of Combinatorics	2024-11-28	Paper
Chromatic polynomials of 2-edge-coloured graphs The Electronic Journal of Combinatorics	2024-02-16	Paper
Existence of optimally‐greatest digraphs for strongly connected node reliability Networks	2023-12-18	Paper
Network reliability: Heading out on the highway Networks	2023-12-11	Paper
Eternal distance-\(k\) domination on graphs La Matematica	2023-06-30	Paper
scientific article; zbMATH DE number 7556143 (Why is no real title available?)	2022-07-13	Paper
Optimal domination polynomials Graphs and Combinatorics	2021-02-16	Paper
Complete Graphs and Polyominoes	2020-10-13	Paper
Counting Path Configurations in Parallel Diffusion	2020-10-09	Paper
A note on polynomial profiles of placement games	2020-07-10	Paper
Diffusion: Quiescence and Perturbation	2020-03-23	Paper
The damage number of a graph	2019-12-19	Paper
Chromatic polynomials of oriented graphs The Electronic Journal of Combinatorics	2019-09-30	Paper
Chromatic polynomials of oriented graphs The Electronic Journal of Combinatorics	2019-09-30	Paper
Optimal graphs for independence and \(k\)-independence polynomials Graphs and Combinatorics	2019-01-11	Paper
scientific article; zbMATH DE number 6982122 (Why is no real title available?)	2018-11-21	Paper
Inflection points of reliability polynomials are dense in \([0,1\)] Networks	2018-05-23	Paper
Nonexistence of optimal graphs for all terminal reliability Networks	2018-05-11	Paper
The average reliability of a graph Discrete Applied Mathematics	2014-09-08	Paper
The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane Discrete Mathematics	2009-12-15	Paper

Research outcomes over time

This page was built for person: D. Cox