7 citations · 8 across the 15 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.CO2016
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…
math.CO2016★ 1 cited
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 $…