Keaitsuda Maneeruk Nakprasit

collaborators

2 papers

math.CO2016

Bounds for the game coloring number of planar graphs with a specific girth

Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit

Let $co l_{g} (G)$ be the game coloring number of a given graph $G .$ Define the game coloring number of a family of graphs $H$ as ${\rm col_g}(\mathcal{H}) := \max\{{\r…

math.CO2012

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…