Title : ( An upper bound for the equitable chromatic number of complete n-partite graphs )
Authors: Freydoon Rahbarnia , ,
دانلود فایل برای اعضای دانشگاهAccess to full-text not allowed by authors
Abstract
A proper vertex coloring of a graph G is equitable if the size of color classes differ by at most one. The equitable chromatic number of G is the smallest integer m such that G is equitable m-colorable. In this paper, we derive an upper bound for the equitable chromatic number of complete n-partite graph Kp1;p2;:::;pn .
Keywords
, Complete n-partite graph, Equitable chromatic number.
@article{paperid:1043762,
author = {Rahbarnia, Freydoon and , },
title = {An upper bound for the equitable chromatic number of complete n-partite graphs},
journal = {Journal Nonlinear Analysis and Application},
year = {2014},
volume = {2014},
number = {1},
month = {October},
issn = {2193-3472},
pages = {1--7},
numpages = {6},
keywords = {Complete n-partite graph; Equitable chromatic number.},
}
%0 Journal Article
%T An upper bound for the equitable chromatic number of complete n-partite graphs
%A Rahbarnia, Freydoon
%A ,
%J Journal Nonlinear Analysis and Application
%@ 2193-3472
%D 2014
