Equitable Colorings Of Corona Multiproducts Of Graphs

A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the numbers of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and denoted by 𝜒=(G). It is kn...

Full description

Bibliographic Details
Main Authors: Furmánczyk Hanna, Kubale Marek, Mkrtchyan Vahan V.
Format: Article
Language:English
Published: Sciendo 2017-11-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:http://www.degruyter.com/view/j/dmgt.2017.37.issue-4/dmgt.1992/dmgt.1992.xml?format=INT