The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Equitable Colorings Of Corona Multiproducts Of Graphs

Hanna FurmánczykMarek KubaleVahan V. Mkrtchyan — 2017

Discussiones Mathematicae Graph Theory

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 known that the problem of computation of 𝜒=(G) is NP-hard in general and remains so for corona graphs. In this paper we consider the same model of coloring in the case of corona multiproducts of graphs....

Page 1

Download Results (CSV)