Grant Keady

Learn More
A porous rectangular dam is above a horizontal impermeable base. There is a steady ow in which water seeps through the dam from one reservoir (on the left) to a lower reservoir (on the right). Because of gravity the water does not ow through the entire dam and the dam is dry near its upper right corner. The interface separating the dry and wet regions of(More)
A graph is (m, k)-colourable if its vertices can be coloured with m colours such that the maximum degree of the subgraph induced on the set of all vertices receiving the same colour is at most k. The k-defective chromatic number χ k (G) is the least positive integer m for which graph G is (m, k)-colourable. Let f (m, k; planar) be the smallest order of a(More)
In this paper Computer Aided Assessment (CAA) systems involving the delivery of questions across the web that are underpinned by Computer Algebra (CA) packages are discussed. This underpinning allows students to enter answers, have them parsed by the CA system, have them type­checked by the CA system, which are then passed through a marking procedure which(More)
A graph is (m, k)-colourable if its vertices can be coloured with m colours such that the maximum degree of any subgraph induced on vertices receiving the same colour is at most k. The k-defective chromatic number for a graph is the least positive integer m for which the graph is (m, k)-colourable. All triangle-free graphs on 8 or fewer vertices are (2,(More)