Kittikorn Nakprasit

According to our database1, Kittikorn Nakprasit authored at least 24 papers between 2003 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
A Generalization of Some Results on List Coloring and DP-Coloring.
Graphs Comb., 2020

DP-4-colorability of planar graphs without adjacent cycles of given length.
Discret. Appl. Math., 2020

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

2018
The Game Coloring Number of Planar Graphs with a Specific Girth.
Graphs Comb., 2018

Defective 2-colorings of planar graphs without 4-cycles and 5-cycles.
Discret. Math., 2018

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

2017
The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs.
Inf. Process. Lett., 2017

Graphs with Bounded Maximum Average Degree and Their Neighbor Sum Distinguishing Total-Choice Numbers.
Int. J. Math. Math. Sci., 2017

2015
The strong chromatic index of graphs with restricted Ore-degrees.
Ars Comb., 2015

2014
The strong chromatic index of graphs and subdivisions.
Discret. Math., 2014

(2, t)-choosasble graphs.
Ars Comb., 2014

2013
On a conjecture about (k, t)-choosability.
Ars Comb., 2013

2012
Equitable colorings of planar graphs without short cycles.
Theor. Comput. Sci., 2012

Equitable colorings of planar graphs with maximum degree at least nine.
Discret. Math., 2012

2008
Packing d-degenerate graphs.
J. Comb. Theory, Ser. B, 2008

A note on the strong chromatic index of bipartite graphs.
Discret. Math., 2008

Coloring the complements of intersection graphs of geometric figures.
Discret. Math., 2008

2006
Transversal numbers of translates of a convex body.
Discret. Math., 2006

2005
On equitable <i>Delta</i>-coloring of graphs with low average degree.
Theor. Comput. Sci., 2005

On Equitable Coloring of d-Degenerate Graphs.
SIAM J. Discret. Math., 2005

2004
On the Chromatic Number of the Square of the Kneser Graph <i>K</i>(2 <i>k</i>+1, <i>k</i>).
Graphs Comb., 2004

On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane.
Electron. J. Comb., 2004

2003
Equitable Colourings Of D-Degenerate Graphs.
Comb. Probab. Comput., 2003

Equitable colorings with constant number of colors.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003


  Loading...