Pongpat Sittitrai

According to our database, Pongpat Sittitrai authored at least 11 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition.

Wipawee Tangjai, Kittikorn Nakprasit, Keaitsuda Maneeruk Nakprasit, Pongpat Sittitrai

Discret. Appl. Math., January, 2024

2023

Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles.

Kittikorn Nakprasit, Watcharintorn Ruksasakchai, Pongpat Sittitrai

Theor. Comput. Sci., 2023

Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles.

Sarawute Sribunhung, Keaitsuda Nakprasit, Kittikorn Nakprasit, Pongpat Sittitrai

Discuss. Math. Graph Theory, 2023

2022

An analogue of DP-coloring for variable degeneracy and its applications.

Pongpat Sittitrai, Kittikorn Nakprasit

Discuss. Math. Graph Theory, 2022

Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate.

Pongpat Sittitrai, Kittikorn Nakprasit

Discret. Math., 2022

2021

Defective DP-colorings of sparse multigraphs.

Yifan Jing, Alexandr V. Kostochka, Fuhong Ma, Pongpat Sittitrai, Jingwei Xu

Eur. J. Comb., 2021

Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate.

Pongpat Sittitrai, Kittikorn Nakprasit

Discret. Math., 2021

2020

DP-4-colorability of planar graphs without adjacent cycles of given length.

Runrun Liu, Xiangwen Li, Kittikorn Nakprasit, Pongpat Sittitrai, Gexin Yu

Discret. Appl. Math., 2020

2019

Sufficient Conditions on Planar Graphs to Have a Relaxed DP-3-Coloring.

Pongpat Sittitrai, Kittikorn Nakprasit

Graphs Comb., 2019

2018

Defective 2-colorings of planar graphs without 4-cycles and 5-cycles.

Pongpat Sittitrai, Kittikorn Nakprasit

Discret. Math., 2018

Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable.

Pongpat Sittitrai, Kittikorn Nakprasit

CoRR, 2018