Equitable chromatic number of complete multipartite graphs
An equitable \(n\)-coloring of a graph \(G\) is a proper \(n\)-coloring of \(G\) such that the color classes \(V_i\) satisfy the condition \(||V_i|-|V_j||\leq 1\) for all \(i,j\) with \(1 \leq i\), \(j \leq n\). The equitable chromatic number \(\chi_e(G)\) is the smallest integer \(n\) such that \(G\) can be equitably colored with \(n\) colors. Given positive integers \(p_1, p_2, \dots , p_k\), the complete \(k\)-partite graph \(K(p_1, p_2, \dots , p_k)\) is the graph whose vertex set is the union \(P_1 \cup P_2 \cup \cdots \cup P_k\) of \(k\) partite sets, each \(P_i\) consists of \(p_i\) vertices, and two vertices are adjacent if and only if they belong to different partite sets. The main theorem of this paper says that \(\chi_e(K(p_1, p_2, \dots , p_k))=\sum_{i=1}^k(\lfloor p_i/x \rfloor - \lfloor \lfloor p_i/x \rfloor - p_i/(x+1) \rfloor)\), where \(x\) is the largest integer satisfying \(p_i/(x+1) \leq \lfloor p_i/x \rfloor\) for each \(i\) with \(1 \leq i \leq k\).
- On the equitable chromatic number of complete \(n\)-partite graphs
- Some chromatic equivalence classes of complete multipartite graphs
- Equitable total chromatic number of splitting graph
- Equitable total chromatic numbers of the square graphs of some graphs
- Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs
- A study of the total chromatic number of equibipartite graphs
- Total colorings of equibipartite graphs
- On equitable coloring of complete r-partite graphs
- On r-equitable coloring of complete multipartite graphs
- Equipartite edge colouring of multigraphs
- Improving lower bounds for equitable chromatic number
- Equitable total coloring of complete $r$-partite $p$-balanced graphs
- Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs
- Equitable colorings of line graphs and complete \(r\)-partite graphs
- On equitable coloring of complete r-partite graphs
- The equitable total chromatic number of S_m S_n
- Equipartite edge colouring of multigraphs
- Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
- Proofs for some known results of equitable coloring
- On r-equitable coloring of complete multipartite graphs
- On r-equitable chromatic threshold of Kronecker products of complete graphs
- scientific article; zbMATH DE number 1750105 (Why is no real title available?)
- Equitable total chromatic number of splitting graph
- Equitable defective colorings of complete bipartite graphs
- Equitable coloring of Kneser graphs
- On \(r\)-equitable colorings of bipartite graphs
- On the equitable chromatic number of complete \(n\)-partite graphs
- Equitable colorings of Kronecker products of graphs
- Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs
- Equitable colorings of Cartesian products of graphs
- The equitable colorings of Kneser graphs
This page was built for publication: Equitable chromatic number of complete multipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1407486)
