207 research outputs found
Equitable Colorings of Corona Multiproducts of Graphs
A graph is equitably -colorable if its vertices can be partitioned into
independent sets in such a way that the number of vertices in any two sets
differ by at most one. The smallest for which such a coloring exists is
known as the equitable chromatic number of and denoted . It is
known that this problem is NP-hard in general case and remains so for corona
graphs. In "Equitable colorings of Cartesian products of graphs" (2012) Lin and
Chang studied equitable coloring of Cartesian products of graphs. In this paper
we consider the same model of coloring in the case of corona products of
graphs. In particular, we obtain some results regarding the equitable chromatic
number for -corona product , where is an equitably 3- or
4-colorable graph and is an -partite graph, a path, a cycle or a
complete graph. Our proofs are constructive in that they lead to polynomial
algorithms for equitable coloring of such graph products provided that there is
given an equitable coloring of . Moreover, we confirm Equitable Coloring
Conjecture for corona products of such graphs. This paper extends our results
from \cite{hf}.Comment: 14 pages, 1 figur
On -Equitable Coloring of Complete Multipartite Graphs
Let and be integers. We say that a graph
has an -equitable -coloring if there exists a proper -coloring of
such that the sizes of any two color classes differ by at most . The least
such that a graph has an -equitable -coloring is denoted by
, and the least such that a graph has an -equitable
-coloring for all is denoted by . In this
paper, we propose a necessary and sufficient condition for a complete
multipartite graph to have an -equitable -coloring, and also give
exact values of and .Comment: 8 pages, 1 figur
Proportional Choosability of Complete Bipartite Graphs
Proportional choosability is a list analogue of equitable coloring that was
introduced in 2019. The smallest for which a graph is proportionally
-choosable is the proportional choice number of , and it is denoted
. In the first ever paper on proportional choosability, it was
shown that when , . In this note we improve on this result
by showing that . In the process, we
prove some new lower bounds on the proportional choice number of complete
multipartite graphs. We also present several interesting open questions.Comment: 11 page
Equitable colorings of complete multipartite graphs
A -\emph{equitable coloring} of a graph is a proper -coloring such
that the sizes of any two color classes differ by at most one. In contrast with
ordinary coloring, a graph may have an equitable -coloring but has no
equitable -coloring. The \emph{equitable chromatic threshold} is the
minimum such that has an equitable -coloring for every
In this paper, we establish the notion of which can
be computed in linear-time and prove the following. Assume that
has an equitable -coloring. Then is the minimum such that has an equitable
-coloring for each satisfying Since
has an equitable -coloring, the
equitable chromatic threshold of is
We find out later that the aforementioned immediate consequence is exactly
the same as the formula of Yan and Wang \cite{YW12}. Nonetheless, the notion of
can be used for each in which
has an equitable -coloring and the proof presented here is much shorter.Comment: arXiv admin note: text overlap with arXiv:1506.0391
Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs
A proper vertex coloring of a graph is equitable if the sizes of color
classes differ by at most 1. The equitable chromatic number of a graph ,
denoted by , is the minimum such that is equitably
-colorable. The equitable chromatic threshold of a graph , denoted by
, is the minimum such that is equitably -colorable for
. In this paper, we give the exact values of and for .Comment: 11 pages. arXiv admin note: substantial text overlap with
arXiv:1208.0918, arXiv:1207.357
Equitable coloring of corona products of cubic graphs is harder than ordinary coloring
A graph is equitably -colorable if its vertices can be partitioned into
independent sets in such a way that the number of vertices in any two sets
differ by at most one. The smallest for which such a coloring exists is
known as the \emph{equitable chromatic number} of and it is denoted by
. In this paper the problem of determinig for coronas of
cubic graphs is studied. Although the problem of ordinary coloring of coronas
of cubic graphs is solvable in polynomial time, the problem of equitable
coloring becomes NP-hard for these graphs. We provide polynomially solvable
cases of coronas of cubic graphs and prove the NP-hardness in a general case.
As a by-product we obtain a simple linear time algorithm for equitable coloring
of such graphs which uses or colors. Our algorithm is
best possible, unless . Consequently, cubical coronas seem to be the only
known class of graphs for which equitable coloring is harder than ordinary
coloring
Coloring Properties of Categorical Product of General Kneser Hypergraphs
More than 50 years ago Hedetniemi conjectured that the chromatic number of
categorical product of two graphs is equal to the minimum of their chromatic
numbers. This conjecture has received a considerable attention in recent years.
Hedetniemi's conjecture were generalized to hypergraphs by Zhu in 1992.
Hajiabolhassan and Meunier (2016) introduced the first nontrivial lower bound
for the chromatic number of categorical product of general Kneser hypergraphs
and using this lower bound, they verified Zhu's conjecture for some families of
hypergraphs. In this paper, we shall present some colorful type results for the
coloring of categorical product of general Kneser hypergraphs, which generalize
the Hajiabolhassan-Meunier result. Also, we present a new lower bound for the
chromatic number of categorical product of general Kneser hypergraphs which can
be extremely better than the Hajiabolhassan-Meunier lower bound. Using this
lower bound, we enrich the family of hypergraphs satisfying Zhu's conjecture
The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs
A \emph{-tree-coloring} of a graph is a -coloring of vertices
of such that the subgraph induced by each color class is a forest of
maximum degree at most An \emph{equitable -tree-coloring} of a
graph is a -tree-coloring such that the sizes of any two color
classes differ by at most one. Let the \emph{strong equitable vertex
-arboricity} be the minimum such that has an equitable -tree-coloring for every
In this paper, we find the exact value for each and
$va^\equiv_2(K_{l,m,n}).
Equitable vertex arboricity of graphs
An equitable -tree-coloring of a graph is a coloring to vertices
of such that the sizes of any two color classes differ by at most one and
the subgraph induced by each color class is a forest of maximum degree at most
and diameter at most . The minimum such that has an equitable
-tree-coloring for every is called the strong equitable
-vertex-arboricity and denoted by . In this paper,
we give sharp upper bounds for and
by showing that
and
va^{\equiv}_{k,\infty}(K_{n,n})=O(n^{\1/2}) for every . It is also
proved that for every planar graph
with girth at least 5 and for every
planar graph with girth at least 6 and for every outerplanar graph. We
conjecture that for every planar graph
and for
every graph
Making a K_4-free graph bipartite
We show that every K_4-free graph G with n vertices can be made bipartite by
deleting at most n^2/9 edges. Moreover, the only extremal graph which requires
deletion of that many edges is a complete 3-partite graph with parts of size
n/3. This proves an old conjecture of P. Erdos
- …