AbstractThe equitable total chromatic number of a graph G is the smallest integer k for which G has a k-total coloring such that the number of vertices and edges colored with each color differs by at most one. In this paper, we show that the Cartesian product graphs of Cm and Cn have equitable total 5-coloring for all m≥3 and n≥3
<p>The notion of equitable colorability was introduced by Meyer in $1973$ \cite{meyer}. In this pape...
International audienceThis paper studies edge- and total-colorings of graphs in which (all or only a...
對正整數 $k$, 如果我們能將一個圖 $G$ 中所有的點著 $k$ 種顏色, 使得兩個相鄰的點所著的顏色相異, 而且任兩種顏色類在數量上差距最多一個, 則我們稱圖 $G$ 是均勻 $k$-可著的. ...
AbstractThe equitable total chromatic number of a graph G is the smallest integer k for which G has ...
The equitable total chromatic number is the smallest integer k for which the graph G has a proper co...
A total coloring is equitable if the number of elements colored with each color differs by at most o...
AbstractThe present paper studies the following variation of vertex coloring on graphs. A graph G is...
The notion of equitable coloring was introduced by Meyer in 1973. In this paper we obtain interestin...
The minimum number of total independent partition sets of V ∪ E of a graph G = (V, E) is called the ...
A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such ...
AbstractIf the vertices of a graph G are partitioned into k classes V1, V2, …, Vk such that each Vi ...
An equitable k-coloring of a graph G is a proper k-coloring of G such that the sizes of any two colo...
A graph is $k$-total colourable if there is an assignment of $k$ different colours to the vertices a...
The equitable edge chromatic number is the minimum number of colors required to color the edges of g...
AbstractIn this note, we derive an explicit formula for the equitable chromatic number of a complete...
<p>The notion of equitable colorability was introduced by Meyer in $1973$ \cite{meyer}. In this pape...
International audienceThis paper studies edge- and total-colorings of graphs in which (all or only a...
對正整數 $k$, 如果我們能將一個圖 $G$ 中所有的點著 $k$ 種顏色, 使得兩個相鄰的點所著的顏色相異, 而且任兩種顏色類在數量上差距最多一個, 則我們稱圖 $G$ 是均勻 $k$-可著的. ...
AbstractThe equitable total chromatic number of a graph G is the smallest integer k for which G has ...
The equitable total chromatic number is the smallest integer k for which the graph G has a proper co...
A total coloring is equitable if the number of elements colored with each color differs by at most o...
AbstractThe present paper studies the following variation of vertex coloring on graphs. A graph G is...
The notion of equitable coloring was introduced by Meyer in 1973. In this paper we obtain interestin...
The minimum number of total independent partition sets of V ∪ E of a graph G = (V, E) is called the ...
A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such ...
AbstractIf the vertices of a graph G are partitioned into k classes V1, V2, …, Vk such that each Vi ...
An equitable k-coloring of a graph G is a proper k-coloring of G such that the sizes of any two colo...
A graph is $k$-total colourable if there is an assignment of $k$ different colours to the vertices a...
The equitable edge chromatic number is the minimum number of colors required to color the edges of g...
AbstractIn this note, we derive an explicit formula for the equitable chromatic number of a complete...
<p>The notion of equitable colorability was introduced by Meyer in $1973$ \cite{meyer}. In this pape...
International audienceThis paper studies edge- and total-colorings of graphs in which (all or only a...
對正整數 $k$, 如果我們能將一個圖 $G$ 中所有的點著 $k$ 種顏色, 使得兩個相鄰的點所著的顏色相異, 而且任兩種顏色類在數量上差距最多一個, 則我們稱圖 $G$ 是均勻 $k$-可著的. ...
DOI
Add to ORKG