1 citations · 1 across the 13 of their papers we have counts for
6 papers · 1 filter
Expanders Satisfy the Weak Meyniel Conjecture
Alexander Clow
We show that if is a sequence of graphs of order with bounded maximum degree and isoperimetric function bounded away from as $n\rightar…
Injective edge colorings of degenerate graphs and the oriented chromatic number
Peter Bradshaw, Alexander Clow, Jingwei Xu
Given a graph , an injective edge-coloring of is a function such that if , then no third edge joins an endpoint of and an en…
Eternal Distance-2 Domination in Trees
Alexander Clow, Christopher M van Bommel
We consider the eternal distance-2 domination problem, recently proposed by Cox, Meger, and Messinger, on trees. We show that finding a minimum eternal distance-2 dominating set of…
Graphs with Large Girth and Small Cop Number
Alexander Clow
In this paper we consider the cop number of graphs with no, or few, short cycles. We show that when is graph of girth and the minimum degree , then $c(G) = O(n\log…
Ordinal Sums of Numbers
Alexander Clow, Neil McKay
In this paper we consider ordinal sums of combinatorial games where each summand is a number, not necessarily in canonical form. In doing so we give formulas for the value of an or…
Oriented Colouring Graphs of Bounded Degree and Degeneracy
Alexander Clow, Ladislav Stacho
This paper considers upper bounds on the oriented chromatic number , of an oriented graph in terms of its -dipath chromatic number , degeneracy , and m…