7 citations · 8 across the 15 of their papers we have counts for
16 papers
-Colorability of Planar Graphs Excluding -, -, and -Cycles
Pongpat Sittitrai, Wannapol Pimpasalee, Kittikorn Nakprasit
A defective -coloring is a coloring on the vertices of a graph using colors such that adjacent vertices may share the same color. A -\emph{coloring} o…
Partitioning planar graphs without 4-cycles and 6-cycles into a forest and a disjoint union of paths
Pongpat Sittitrai, Kittikorn Nakprasit
In this paper, we show that every planar graph without -cycles and -cycles has a partition of its vertex set into two sets, where one set induces a forest, and the other indu…
The strong equitable vertex 1-arboricity of complete bipartite graphs and balanced complete k-partite graphs
Janejira Laomala, Keaitsuda Nakprasit, Kittikorn Nakprasit +1
An \emph{equitable -tree-coloring} of a graph is a -coloring of such that the subgraph induced by each color class is a forest of maximum degree at most and…
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…
Planar graphs without pairwise adjacent 3-,4-,5-, and 6-cycle are 4-choosable
Pongpat Sittitrai, Kittikorn Nakprasit
Xu and Wu proved that if every 5-cycle of a planar graph G is not simultaneously adjacent to 3-cycles and 4-cycles, then G is 4-choosable. In this paper, we improve this result as…
Analogue of DP-coloring on variable degeneracy and its applications on list vertex-arboricity and DP-coloring
Pongpat Sittitrai, Kittikorn Nakprasit
In \cite{listnoC3adjC4}), Borodin and Ivanova proved that every planar graph without -cycles adjacent to -cycle is list vertex--aborable. In fact, they proved a more gener…
Sufficient conditions on planar graphs to have a relaxed DP--colorability
Pongpat Sittitrai, Kittikorn Nakprasit
It is known that DP-coloring is a generalization of a list coloring in simple graphs and many results in list coloring can be generalized in those of DP-coloring. In this work, we…
Every planar graph without -cycles adjacent simultaneously to -cycles and -cycles is DP--colorable when
Pongpat Sittitrai, Kittikorn Nakprasit
DP-coloring is a generalization of a list coloring in simple graphs. Many results in list coloring can be generalized in those of DP-coloring. Kim and Ozeki showed that planar grap…
Sufficient conditions on cycles that make planar graphs 4-choosable
Pongpat Sittitrai, Kittikorn Nakprasit
Xu and Wu proved that if every -cycle of a planar graph is not simultaneously adjacent to -cycles and -cycles, then is -choosable. In this paper, we improve thi…
Some conditions on 5-cycles that make planar graphs 4-choosable
Pongpat Sittitrai, Kittikorn Nakprasit
Consider two conditions on a graph: (1) each 5-cycle is not a subgraph of 5-wheel and does not share exactly one edge with 3-cycle, and (2) each 5-cycle is not adjacent to two 3-cy…
Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
Pongpat Sittitrai, Kittikorn Nakprasit
Let be a graph without 4-cycles and 5-cycles. We show that the problem to determine whether is -colorable is NP-complete for each positive integer Moreover, we…
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 $…
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…
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 …
Equitable Colorings of Planar Graphs without Short Cycles
Keaitsuda Nakprasit, Kittikorn Nakprasit
An \emph{equitable coloring} of a graph is a proper vertex coloring such that the sizes of every two color classes differ by at most 1. Chen, Lih, and Wu conjectured that every con…