Get started
Author

Pongpat Sittitrai

Observed name: Sittitrai, Pongpat
Institution: Walailak University
ORCID: 0000-0002-1770-8369
Observed ORCID: 0000-0002-1770-8369
OpenAlex ID: A5087456690
DP-4-colorability of planar graphs without adjacent cycles of given length
2019 · Runrun Liu, Xiangwen Li, et al. · Discrete Applied Mathematics · 20
Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
2018 · Pongpat Sittitrai, Kittikorn Nakprasit · Discrete Mathematics · 19
PDF
Every Planar Graph Without Pairwise Adjacent 3-, 4-, and 5-Cycle is DP-4-Colorable
2019 · Pongpat Sittitrai, Kittikorn Nakprasit · Bulletin of the Malaysian Mathematical Sciences Society · 10
PDF
Planar graphs without 4- and 6-cycles are (3,4) -colorable
2024 · Kittikorn Nakprasit, Pongpat Sittitrai, et al. · Discrete Applied Mathematics · 7
Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate
2022 · Pongpat Sittitrai, Kittikorn Nakprasit · Discrete Mathematics · 7
Defective DP-colorings of sparse multigraphs
2020 · Yifan Jing, Alexandr Kostochka, et al. · European Journal of Combinatorics · 7
An analogue of DP-coloring for variable degeneracy and its applications
2019 · Pongpat Sittitrai, Kittikorn Nakprasit · Discussiones Mathematicae Graph Theory · 7
Sufficient Conditions on Planar Graphs to Have a Relaxed DP-3-Coloring
2019 · Pongpat Sittitrai, Kittikorn Nakprasit · Graphs and Combinatorics · 6
PDF
Analogue of DP-coloring on variable degeneracy and its applications on list vertex-arboricity and DP-coloring
2018 · Sittitrai, Pongpat, Nakprasit, Kittikorn · arXiv (Cornell University) · 6
PDF
Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate
2021 · Pongpat Sittitrai, Kittikorn Nakprasit · Discrete Mathematics · 5
A Weak DP-Partitioning of Planar Graphs without 4-Cycles and 6-Cycles
2023 · Pongpat Sittitrai, Keaitsuda Maneeruk Nakprasit, et al. · Bulletin of the Malaysian Mathematical Sciences Society · 4
Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition
2023 · Wipawee Tangjai, Kittikorn Nakprasit, et al. · Discrete Applied Mathematics · 3
Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles
2021 · Sarawute Sribunhung, Keaitsuda Nakprasit, et al. · Discussiones Mathematicae Graph Theory · 3
Planar Graphs without Cycles of Length 3, 4, and 6 are (3, 3)-Colorable
2024 · Pongpat Sittitrai, Wannapol Pimpasalee · International Journal of Mathematics and Mathematical Sciences · 2
Planar graphs without triangles adjacent to $6$-cycles are DP-$4$-colorable
2018 · Pongpat Sittitrai, Kittikorn Nakprasit · arXiv (Cornell University) · 2
Planar Graphs Without Pairwise Adjacent $3$-, $4$-, $5$-, and $6$-cycle are $4$-choosable
2021 · Kittikorn Nakprasit, Pongpat Sittitrai · Taiwanese Journal of Mathematics · 1
PDF
Sufficient conditions on cycles that make planar graphs 4-choosable
2017 · Sittitrai, Pongpat, Nakprasit, Kittikorn · arXiv (Cornell University) · 1
PDF
Some conditions on 5-cycles that make planar graphs 4-choosable
2017 · Sittitrai, Pongpat, Nakprasit, Kittikorn · arXiv (Cornell University) · 1
PDF
The Independent Bondage Number of Planar Graphs Without Short Cycles
2026 · Pongpat Sittitrai, Wannapol Pimpasalee · Mathematics
Planar Graphs Without 4-Cycles Are (6, 6)-Colorable
2025 · Pongpat Sittitrai, Wannapol Pimpasalee, et al. · Symmetry
PDF
(2, 4)-Colorability of Planar Graphs Excluding Cycles with 3, 4, and 6 Vertices
2025 · Pongpat Sittitrai, Wannapol Pimpasalee, et al. · Mathematics
PDF
The Total Choosability with Neighbor Sum Distinguishing Properties of Planar Graphs That Are Devoid of \(C_5\) Adjacent to \(C_3\)
2025 · Pongpat Sittitrai, Kittikorn Nakprasit, et al. · European Journal of Pure and Applied Mathematics
PDF
Partitioning Planar Graphs Without Specific Cycles into a Forest and a Disjoint Union of Paths
2025 · Pongpat Sittitrai, Keaitsuda Maneeruk Nakprasit, et al. · Axioms
PDF
Edge DP-coloring of planar graphs without 4-cycles and specific cycles
2024 · Patcharapan Jumnongnit, Kittikorn Nakprasit, et al. · Discrete Mathematics
Sufficient Conditions make Graphs Edge DP-$$\varDelta $$-Colorable
2024 · Watcharintorn Ruksasakchai, Pongpat Sittitrai · Graphs and Combinatorics
Works count: 28
Citation count: 111
H-index: 7
I10-index: 3
Year
Topic
Type