Related papers: Equitable coloring of k-uniform hypergraphs

Fix $k \geq 3$, and let $G$ be a $k$-uniform hypergraph with maximum degree $\Delta$. Suppose that for each $l = 2, ..., k-1$, every set of l vertices of G is in at most $\Delta^{(k-l)/(k-1)}/f$ edges. Then the chromatic number of $G$ is…

An equitable $k$-coloring of a graph is a proper $k$-coloring where the sizes of any two different color classes differ by at most one. In 1973, Meyer conjectured that every connected graph $G$ has an equitable $k$-coloring for some $k\leq…

A coloring of vertices of a graph is called perfect if, for every vertex, the collection of colors of its neighbors depends only on its own color. The correspondent color partition of vertices is called equitable. We note that a number of…

A linearly ordered (LO) $k$-colouring of an $r$-uniform hypergraph assigns an integer from $\{1, \ldots, k \}$ to every vertex so that, in every edge, the (multi)set of colours has a unique maximum. Equivalently, for $r=3$, if two vertices…

A $k$-uniform hypergraph $H = (V, E)$ is $k$-partite if $V$ can be partitioned into $k$ sets $V_1, \ldots, V_k$ such that every edge in $E$ contains precisely one vertex from each $V_i$. We call such a graph $n$-balanced if $|V_i| = n$ for…

An $r$-uniform hypergraph is uniquely $k$-colorable if there exists exactly one partition of its vertex set into $k$ parts such that every edge contains at most one vertex from each part. For integers $k \ge r \ge 2$, let $\Phi_{k,r}$…

For any given integer $r\geqslant 3$, let $k=k(n)$ be an integer with $r\leqslant k\leqslant n$. A hypergraph is $r$-uniform if each edge is a set of $r$ vertices, and is said to be linear if two edges intersect in at most one vertex. Let…

A proper coloring of vertices of a graph is equitable if the sizes of any two color classes differ by at most 1. Such colorings have many applications and are interesting by themselves. In this paper, we discuss the state of art and…

A proper vertex coloring of a graph is equitable if the sizes of color classes differ by at most one. The equitable chromatic number of a graph $G$, denoted by $\chi_=(G)$, is the minimum $k$ such that $G$ is equitably $k$-colorable. The…

In 2003 Kostochka, Pelsmajer, and West introduced a list analogue of equitable coloring called equitable choosability. A $k$-assignment, $L$, for a graph $G$ assigns a list, $L(v)$, of $k$ available colors to each $v \in V(G)$, and an…

We demonstrate that for every positive integer $\Delta$, every K\_4-minor-free graph with maximum degree $\Delta$ admits an equitable coloring with k colors wherek $\ge$ ($\Delta$+3)/2. This bound is tight and confirms a conjecture by Zhang…

For a graph $G$, the \emph{equitable chromatic number} of $G$, denoted by $\chi_e(G)$, is the smallest integer $k$ such that $G$ admits a proper $k$-coloring whose color classes differ in size by at most one. We prove that for every…

A graph $G$ is $r$-equitably $k$-colorable if its vertex set can be partitioned into $k$ independent sets, any two of which differ in size by at most $r$. The $r$-equitable chromatic threshold of a graph $G$, denoted by $\chi_{r=}^*(G)$, is…

An edge-coloring of a hypergraph is {\em spanning} if every vertex sees every color used in the coloring. In this paper, we prove that for $k \geq 2r \geq 6$, in any spanning $k$-coloring of the edges of a complete $r$-partite $r$-uniform…

A $k$-coloring of a graph $G=(V,E)$ is called semi-equitable if there exists a partition of its vertex set into independent subsets $V_1,\ldots,V_k$ in such a way that $|V_1| \notin \{\lceil |V|/k\rceil, \lfloor |V|/k \rfloor\}$ and…

An equitable tree-$k$-coloring of a graph is a vertex $k$-coloring such that each color class induces a forest and the size of any two color classes differ by at most one. In this work, we show that every interval graph $G$ has an equitable…

For graphs $G$ and $H$, a homomorphism from $G$ to $H$, or $H$-coloring of $G$, is a map from the vertices of $G$ to the vertices of $H$ that preserves adjacency. When $H$ is composed of an edge with one looped endvertex, an $H$-coloring of…

A $q$-\emph{equitable coloring} of a graph $G$ is a proper $q$-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 $q$-coloring but has no equitable…

For every $r\ge13$, we show every 1-planar graph $G$ with $\Delta(G)\le r$ has an equitable $r$-coloring.

Let $k \in \mathbb{N}$ and let $G$ be a simple graph with maximum degree $\Delta$. A $k$-colouring $\varphi$ of $G$ is an assignment of colours from $\{1,2,\ldots,k\}$ to the vertices of $G$. We call $\varphi$ proper if adjacent vertices…