The Nordhaus-Gaddum problem for the k-defective chromatic number of a P4-free graph

The Nordhaus-Gaddum problem for the k-defective chromatic number of a P4-free graph

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 vertices receiving the same colour is at most k. The k-defective chromatic number Xk(G) of a graph G is the least positive integer m for which G is (m, k)-colourable. T...

Full description

Bibliographic Details
Main Authors: Achuthan, Nirmala, Achuthan, Narasimaha, Simanihuruk, M.
Format: Journal Article
Published: Centre for Discrete Mathematics and Computing 2011
Online Access:http://hdl.handle.net/20.500.11937/11944

Similar Items

Similar Items