Kittikorn Nakprasit

From MaRDI portal
Person:318920

Available identifiers

zbMath Open nakprasit.kittikornMaRDI QIDQ318920

List of research outcomes





PublicationDate of PublicationType
Planar graphs without 4- and 6-cycles are \(( 3 , 4 )\)-colorable2024-08-09Paper
Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition2024-01-24Paper
A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles2023-07-13Paper
Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles2023-01-04Paper
Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles2022-12-02Paper
Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate2022-06-14Paper
Partitioning planar graphs without 4-cycles and 6-cycles into a forest and a disjoint union of paths2022-03-12Paper
Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable2022-02-28Paper
An analogue of DP-coloring for variable degeneracy and its applications2022-01-03Paper
https://portal.mardi4nfdi.de/entity/Q33847192021-12-17Paper
Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate2021-09-06Paper
The strong equitable vertex 1-arboricity of complete bipartite graphs and balanced complete k-partite graphs2021-07-01Paper
A generalization of some results on list coloring and DP-coloring2020-06-24Paper
Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable2020-04-23Paper
DP-4-colorability of planar graphs without adjacent cycles of given length2020-03-23Paper
Sufficient conditions on planar graphs to have a relaxed DP-3-coloring2019-06-28Paper
Mean nonexpansive mappings and Suzuki-generalized nonexpansive mappings2018-08-21Paper
Analogue of DP-coloring on variable degeneracy and its applications on list vertex-arboricity and DP-coloring2018-07-02Paper
Defective 2-colorings of planar graphs without 4-cycles and 5-cycles2018-06-07Paper
Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers2018-05-25Paper
The game coloring number of planar graphs with a specific girth2018-04-13Paper
Every planar graph without $i$-cycles adjacent simultaneously to $j$-cycles and $k$-cycles is DP-$4$-colorable when $\{i,j,k\}=\{3,4,5\}$2018-01-20Paper
Sufficient conditions on cycles that make planar graphs 4-choosable2017-09-14Paper
Some conditions on 5-cycles that make planar graphs 4-choosable2017-06-15Paper
On list chromatic number of \(L(2,0)\)-labeling of a complete bipartite graph \(K_{2,n}\)2017-02-24Paper
The strong chromatic index of graphs and subdivisions2016-10-06Paper
Bounds for the game coloring number of planar graphs with a specific girth2016-10-04Paper
Flexible coloring of graphs2016-09-16Paper
The strong chromatic index of graphs with restricted Ore-degrees.2016-05-04Paper
Complexity of equitable tree-coloring problems2016-03-30Paper
Graceful labeling of some classes of spider graphs with three legs greater than one2015-12-04Paper
Equitable colorings of complete multipartite graphs2015-08-17Paper
Online List Colorings with the Fixed Number of Colors2015-03-23Paper
\((2,t)\)-choosable graphs2015-01-06Paper
https://portal.mardi4nfdi.de/entity/Q29314982014-11-25Paper
The strong chromatic index of graphs and subdivisions2014-01-17Paper
Equitable colorings of planar graphs without short cycles2013-01-07Paper
Incidence colorings of the powers of cycles2012-09-14Paper
Equitable colorings of planar graphs with maximum degree at least nine2012-03-16Paper
Weak and strong convergence theorems of an implicit iteration process for a countable family of nonexpansive mappings2009-03-30Paper
Coloring the complements of intersection graphs of geometric figures2008-09-04Paper
A note on the strong chromatic index of bipartite graphs2008-07-11Paper
Packing \(d\)-degenerate graphs2007-12-10Paper
Transversal numbers of translates of a convex body2006-10-19Paper
On equitable \(\Delta\)-coloring of graphs with low average degree2006-03-20Paper
On Two Conjectures on Packing of Graphs2005-11-14Paper
On Equitable Coloring of d-Degenerate Graphs2005-09-16Paper
On the chromatic number of the square of the Kneser graph \(K(2k+1,k)\)2004-12-13Paper
On the chromatic number of intersection graphs of convex sets in the plane2004-10-13Paper
https://portal.mardi4nfdi.de/entity/Q44713292004-07-28Paper
Equitable Colourings of d-degenerate Graphs2003-06-13Paper

Research outcomes over time

This page was built for person: Kittikorn Nakprasit