The following pages link to Kittikorn Nakprasit (Q318920):
Displayed 50 items.
- The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs (Q318921) (← links)
- Equitable colorings of planar graphs with maximum degree at least nine (Q764891) (← links)
- Item:Q318920 (redirect page) (← links)
- On equitable \(\Delta\)-coloring of graphs with low average degree (Q817775) (← links)
- A note on the strong chromatic index of bipartite graphs (Q932702) (← links)
- Coloring the complements of intersection graphs of geometric figures (Q941403) (← links)
- Weak and strong convergence theorems of an implicit iteration process for a countable family of nonexpansive mappings (Q1008516) (← links)
- Defective 2-colorings of planar graphs without 4-cycles and 5-cycles (Q1637126) (← links)
- The game coloring number of planar graphs with a specific girth (Q1743687) (← links)
- Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers (Q1751539) (← links)
- On the chromatic number of intersection graphs of convex sets in the plane (Q1883668) (← links)
- On the chromatic number of the square of the Kneser graph \(K(2k+1,k)\) (Q1889846) (← links)
- Equitable colorings of planar graphs without short cycles (Q1929237) (← links)
- Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate (Q1981692) (← links)
- Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable (Q1988544) (← links)
- Sufficient conditions on planar graphs to have a relaxed DP-3-coloring (Q2000575) (← links)
- An analogue of DP-coloring for variable degeneracy and its applications (Q2062675) (← links)
- Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable (Q2078245) (← links)
- Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles (Q2107762) (← links)
- Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate (Q2144489) (← links)
- A generalization of some results on list coloring and DP-coloring (Q2191273) (← links)
- DP-4-colorability of planar graphs without adjacent cycles of given length (Q2306602) (← links)
- Packing \(d\)-degenerate graphs (Q2464154) (← links)
- Transversal numbers of translates of a convex body (Q2509292) (← links)
- Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles (Q2680856) (← links)
- (Q2804765) (← links)
- FLEXIBLE COLORING OF GRAPHS (Q2820431) (← links)
- (Q2912221) (← links)
- (Q2931498) (← links)
- (Q2936718) (← links)
- ON LIST CHROMATIC NUMBER OF L(2, 0)-LABELING OF A COMPLETE BIPARTITE GRAPH K_{2, n} (Q2964349) (← links)
- (Q3384719) (← links)
- (Q3455456) (← links)
- (Q4471329) (← links)
- (Q4581779) (← links)
- Equitable Colourings of d-degenerate Graphs (Q4796725) (← links)
- On Equitable Coloring of <i>d</i>-Degenerate Graphs (Q5317598) (← links)
- On Two Conjectures on Packing of Graphs (Q5704386) (← links)
- Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition (Q6143874) (← links)
- A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles (Q6173908) (← links)
- Online List Colorings with the Fixed Number of Colors (Q6260204) (← links)
- Equitable colorings of complete multipartite graphs (Q6264629) (← links)
- Complexity of equitable tree-coloring problems (Q6272004) (← links)
- Bounds for the game coloring number of planar graphs with a specific girth (Q6278296) (← links)
- Some conditions on 5-cycles that make planar graphs 4-choosable (Q6287913) (← links)
- Sufficient conditions on cycles that make planar graphs 4-choosable (Q6291266) (← links)
- 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\}$ (Q6296719) (← links)
- Analogue of DP-coloring on variable degeneracy and its applications on list vertex-arboricity and DP-coloring (Q6303778) (← links)
- The strong equitable vertex 1-arboricity of complete bipartite graphs and balanced complete k-partite graphs (Q6371702) (← links)
- Partitioning planar graphs without 4-cycles and 6-cycles into a forest and a disjoint union of paths (Q6393533) (← links)