On minimal triangle-free graphs with prescribed k-defective chromatic number

On minimal triangle-free graphs with prescribed k-defective chromatic number

A graph G 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 χk(G) is the least positive integer m for which G is (m, k)-colourable. Let f(m, k)...

Full description

Bibliographic Details
Main Authors: Achuthan, Nirmala, Achuthan, Narasimaha, Simanihuruk, M.
Format: Journal Article
Published: Elsevier Science BV 2011
Subjects:
k-defective chromatic number
Triangle-free graphs
k-independence
Online Access:http://hdl.handle.net/20.500.11937/24432

Similar Items

Similar Items