7 citations · 9 across the 10 of their papers we have counts for
10 papers · 1 filter
-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…
Defective DP-colorings of sparse multigraphs
Yifan Jing, Alexandr Kostochka, Fuhong Ma +2
DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvorak and Postle. We introduce and study -defective DP-colori…
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…