7 citations · 8 across the 15 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.CO2015
Equitable colorings of complete multipartite graphs
Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit
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 gr…
math.CO2015
The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs
Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit
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…
math.CO2015
Online List Colorings with the Fixed Number of Colors
Keaitsuda Nakprasit, Kittikorn Nakprasit
The online list coloring is a widely studied topic in graph theory. A graph is 2-paintable if we always have a strategy to complete a coloring in an online list coloring of …