spectrum of graph
Recently Published Documents


TOTAL DOCUMENTS

3
(FIVE YEARS 0)

H-INDEX

2
(FIVE YEARS 0)

2015 ◽  
Vol 25 (1) ◽  
pp. 109-116 ◽  
Author(s):  
Hanna Furmańczyk ◽  
Marek Kubale

Abstract In the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP-complete within a broad spectrum of graph parameters. This affects the complexity of batch scheduling of unit-length jobs with cubic incompatibility graph on three uniform processors to minimize the makespan.


2009 ◽  
Vol 2 (1) ◽  
pp. 93-100 ◽  
Author(s):  
Indulal Gopalapillai

Sign in / Sign up

Export Citation Format

Share Document