Equitable Coloring of Interval Graphs and Products of Graphs
نویسندگان
چکیده
We confirm the equitable ∆-coloring conjecture for interval graphs and establish the monotonicity of equitable colorability for them. We further obtain results on equitable colorability about square (or Cartesian) and cross (or direct) products of graphs.
منابع مشابه
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 number 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 χ=(G). It is known that this problem is NP-hard in general case and remains so for corona graphs. In [12] Lin i Chan...
متن کاملEquitable Colorings of Cartesian Product Graphs of Wheels with Complete Bipartite Graphs
By the sorting method of vertices, the equitable chromatic number and the equitable chromatic threshold of the Cartesian products of wheels with bipartite graphs are obtained. Key–Words: Cartesian product, Equitable coloring, Equitable chromatic number, Equitable chromatic threshold
متن کاملPerfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملEquitable Colorings of Cartesian Products of Fans with Bipartite Graphs
In this paper, by the sorting method of vertices, it is obtained that the equitable chromatic number and the equitable chromatic threshold of the Cartesian products of fans with bipartite graphs.
متن کاملEquitable coloring of corona products of cubic graphs is harder than ordinary coloring
A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number 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 it is denoted by χ=(G). In this paper the problem of determinig χ= for coronas of cubic graphs is studied. Although the prob...
متن کامل