156 citations
- Walailak UniversityTH14 papers
- Chulalongkorn UniversityTH13 papers
- National Astronomical Research Institute of ThailandTH6 papers
- Thailand Center of Excellence in PhysicsTH6 papers
- Ministry of Higher Education, Science, Research and InnovationTH5 papers
- Durham UniversityGB4 papers
- King Mongkut's Institute of Technology LadkrabangTH4 papers
- Naresuan UniversityTH3 papers
- Srinakharinwirot UniversityTH3 papers
- Suranaree University of TechnologyTH3 papers
- University of SussexGB3 papers
- Uppsala UniversitySE3 papers
5 papers · 1 filter
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…
Quadratic addition rules for three -integers
Mongkhon Tuntapthai
The -integer is the polynomial . For every sequences of polynomials , $\mathcal T = \{t_m(q)\}_{m=1}…
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…
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…
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…