2 citations · 3 across the 3 of their papers we have counts for
3 papers
math.CO2015
On minimal triangle-free planar graphs with prescribed 1-defective chromatic number
Nirmala Achuthan, N. R. Achuthan, G. Keady
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…
math.CO2015★ 1 cited
On triangle-free graphs of order 10 with prescribed 1-defective chromatic number
Nirmala Achuthan, N. R. Achuthan, G. Keady
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 ver- tices receiving the same colour is at most…
math.PR2015★ 2 cited
The Langevin function and truncated exponential distributions
Grant Keady
Let K be a random variable following a truncated exponential distribution. Such distributions are described by a single parameter here denoted by . The determination of by M…