1 citations · 2 across the 4 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
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…