Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Achuthan, Nirmala"'
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 $\chi_k(G)$ is the lea
Externí odkaz:
http://arxiv.org/abs/1501.04387
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 k. The k-defective chromatic number for a graph is the least positive
Externí odkaz:
http://arxiv.org/abs/1501.04384
Publikováno v:
In Discrete Mathematics 2011 311(13):1119-1127
Publikováno v:
In Electronic Notes in Discrete Mathematics 2003 15:13-15
Publikováno v:
In Discrete Mathematics 1996 151(1):3-13