Journal
JOURNAL OF GRAPH THEORY
Volume 58, Issue 2, Pages 148-158Publisher
JOHN WILEY & SONS INC
DOI: 10.1002/jgt.20300
Keywords
strong chromatic number; maximum degree; partition
Categories
Ask authors/readers for more resources
Let eta > 0 be given. Then there exists d(0) = d(0)(eta) such that the following holds. Let G be a finite graph with maximum degree at most d >= d(0) whose vertex set is partitioned into classes of size alpha d, where alpha >= 11/4 + eta. Then there exists a proper coloring of G with alpha d colors in which each class receives all alpha d colors. (C) 2008 Wiley Periodicals, Inc.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available