2 citations · 2 across the 3 of their papers we have counts for
4 papers · 1 filter
Generalization of some results on list coloring and DP-coloring
Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit
In this work, we introduce DPG-coloring using the concepts of DP-coloring and variable degeneracy to modify the proofs on the following papers: (i) DP-3-coloring of planar graphs w…
Complexity of equitable tree-coloring problems
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 A $…
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…
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 …