相关论文: Equitable total coloring of corona of cubic graphs

A graph $G$ 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 integer $k$ for which such a coloring exists…

Independently posed by Behzad and Vizing, the Total Coloring Conjecture asserts that the total chromatic number of a simple connected graph $G$ is either $\Delta(G)+1$ or $\Delta(G)+2$, where $\Delta(G)$ is the largest degree of any vertex…

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 total chromatic number, $\chi''(G)$ is the minimum number of colors which need to be assigned to obtain a total coloring of the graph $G$. The Total Coloring Conjecture (TCC) made independently by Behzad and Vizing that for any graph,…

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…

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…

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 $G$, denoted by $\chi_=(G)$, is the minimum $k$ such that $G$ is equitably $k$-colorable. The…

An equitable coloring is a proper coloring of a graph such that the sizes of the color classes differ by at most one. A graph $G$ is equitably $k$-colorable if there exists an equitable coloring of $G$ which uses $k$ colors, each one…

A {\em total coloring} of a graph $G$ is an assignment of colors to the vertices and the edges of $G$ such that every pair of adjacent/incident elements receive distinct colors. The {\em total chromatic number} of a graph $G$, denoted by…

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 total $k$-coloring of a graph $G$ is a coloring of $V(G)\cup E(G)$ using $k$ colors such that no two adjacent or incident elements receive the same color. The total chromatic number $\chi"(G)$ of $G$ is the smallest integer $k$ such that…

\textit{Total Coloring} of a graph is a major coloring problem in combinatorial mathematics, introduced in the early $1960$s. A \textit{total coloring} of a graph $G$ is a map $f:V(G) \cup E(G) \rightarrow \mathcal{K}$, where $\mathcal{K}$…

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 coloring of a graph $G=(V,E)$ is a (proper) vertex-coloring of $G$, such that the sizes of any two color classes differ by at most one. In this paper, we consider the equitable coloring problem in block graphs. Recall that the…

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

A proper vertex coloring of a graph $G$ is equitable if the sizes of color classes differ by at most one. The equitable chromatic threshold $\chi_{eq}^*(G)$ of $G$ is the smallest integer $m$ such that $G$ is equitably $n$-colorable for all…

A proper $[k]$-total coloring $c$ of a graph $G$ is a mapping $c$ from $V(G)\bigcup E(G)$ to $[k]=\{1,2,\cdots,k\}$ such that $c(x)\neq c(y)$ for which $x$, $y\in V(G)\bigcup E(G)$ and $x$ is adjacent to or incident with $y$. Let $\prod(v)$…

Let $G=(V,E)$ be a finite, simple, and connected graph. The locating-chromatic number of a graph $G$ can be defined as the cardinality of a minimum resolving partition of the vertex set $V(G)$ such that all vertices have different…

A proper vertex coloring of the graph $G$ such that each vertex dominates at least one color class and the cardinalities of the color classes differ by at most $1$ is called an equitable dominator coloring of $G$. The minimum number of…

Let $G=(V,E)$ be a graph with no isolated vertices. A vertex $v$ totally dominate a vertex $w$ ($w \ne v$), if $v$ is adjacent to $w$. A set $D \subseteq V$ called a total dominating set of $G$ if every vertex $v\in V$ is totally dominated…