| Publication | Date of Publication | Type |
|---|
Planar graphs without 4- and 6-cycles are \(( 3 , 4 )\)-colorable
Discrete Applied Mathematics | 2024-08-09 | Paper |
Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition
Discrete Applied Mathematics | 2024-01-24 | Paper |
A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2023-07-13 | Paper |
Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles
Theoretical Computer Science | 2023-01-04 | Paper |
Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles
Discussiones Mathematicae Graph Theory | 2022-12-02 | Paper |
Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate
Discrete Mathematics | 2022-06-14 | Paper |
| Partitioning planar graphs without 4-cycles and 6-cycles into a forest and a disjoint union of paths | 2022-03-12 | Paper |
Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable
Taiwanese Journal of Mathematics | 2022-02-28 | Paper |
An analogue of DP-coloring for variable degeneracy and its applications
Discussiones Mathematicae Graph Theory | 2022-01-03 | Paper |
| scientific article; zbMATH DE number 7447359 (Why is no real title available?) | 2021-12-17 | Paper |
Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate
Discrete Mathematics | 2021-09-06 | Paper |
| The strong equitable vertex 1-arboricity of complete bipartite graphs and balanced complete k-partite graphs | 2021-07-01 | Paper |
A generalization of some results on list coloring and DP-coloring
Graphs and Combinatorics | 2020-06-24 | Paper |
Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2020-04-23 | Paper |
DP-4-colorability of planar graphs without adjacent cycles of given length
Discrete Applied Mathematics | 2020-03-23 | Paper |
Sufficient conditions on planar graphs to have a relaxed DP-3-coloring
Graphs and Combinatorics | 2019-06-28 | Paper |
| Mean nonexpansive mappings and Suzuki-generalized nonexpansive mappings | 2018-08-21 | Paper |
| Analogue of DP-coloring on variable degeneracy and its applications on list vertex-arboricity and DP-coloring | 2018-07-02 | Paper |
Defective 2-colorings of planar graphs without 4-cycles and 5-cycles
Discrete Mathematics | 2018-06-07 | Paper |
Graphs with bounded maximum average degree and their neighbor sum distinguishing total-choice numbers
International Journal of Mathematics and Mathematical Sciences | 2018-05-25 | Paper |
The game coloring number of planar graphs with a specific girth
Graphs and Combinatorics | 2018-04-13 | Paper |
| 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-20 | Paper |
| Sufficient conditions on cycles that make planar graphs 4-choosable | 2017-09-14 | Paper |
| Some conditions on 5-cycles that make planar graphs 4-choosable | 2017-06-15 | Paper |
On list chromatic number of \(L(2,0)\)-labeling of a complete bipartite graph \(K_{2,n}\)
Far East Journal of Mathematical Sciences (FJMS) | 2017-02-24 | Paper |
The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs
Information Processing Letters | 2016-10-06 | Paper |
| Bounds for the game coloring number of planar graphs with a specific girth | 2016-10-04 | Paper |
Flexible coloring of graphs
Far East Journal of Mathematical Sciences | 2016-09-16 | Paper |
The strong chromatic index of graphs with restricted Ore-degrees.
Ars Combinatoria | 2016-05-04 | Paper |
| Complexity of equitable tree-coloring problems | 2016-03-30 | Paper |
| Graceful labeling of some classes of spider graphs with three legs greater than one | 2015-12-04 | Paper |
| Equitable colorings of complete multipartite graphs | 2015-08-17 | Paper |
| Online List Colorings with the Fixed Number of Colors | 2015-03-23 | Paper |
| \((2,t)\)-choosable graphs | 2015-01-06 | Paper |
| scientific article; zbMATH DE number 6374014 (Why is no real title available?) | 2014-11-25 | Paper |
The strong chromatic index of graphs and subdivisions
Discrete Mathematics | 2014-01-17 | Paper |
Equitable colorings of planar graphs without short cycles
Theoretical Computer Science | 2013-01-07 | Paper |
Incidence colorings of the powers of cycles
International Journal of Pure and Applied Mathematics | 2012-09-14 | Paper |
Equitable colorings of planar graphs with maximum degree at least nine
Discrete Mathematics | 2012-03-16 | Paper |
Weak and strong convergence theorems of an implicit iteration process for a countable family of nonexpansive mappings
Fixed Point Theory and Applications | 2009-03-30 | Paper |
Coloring the complements of intersection graphs of geometric figures
Discrete Mathematics | 2008-09-04 | Paper |
A note on the strong chromatic index of bipartite graphs
Discrete Mathematics | 2008-07-11 | Paper |
Packing \(d\)-degenerate graphs
Journal of Combinatorial Theory. Series B | 2007-12-10 | Paper |
Transversal numbers of translates of a convex body
Discrete Mathematics | 2006-10-19 | Paper |
On equitable \(\Delta\)-coloring of graphs with low average degree
Theoretical Computer Science | 2006-03-20 | Paper |
On Two Conjectures on Packing of Graphs
Combinatorics, Probability and Computing | 2005-11-14 | Paper |
On Equitable Coloring of d-Degenerate Graphs
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
On the chromatic number of the square of the Kneser graph \(K(2k+1,k)\)
Graphs and Combinatorics | 2004-12-13 | Paper |
On the chromatic number of intersection graphs of convex sets in the plane
The Electronic Journal of Combinatorics | 2004-10-13 | Paper |
On the chromatic number of intersection graphs of convex sets in the plane
The Electronic Journal of Combinatorics | 2004-10-13 | Paper |
| scientific article; zbMATH DE number 2079370 (Why is no real title available?) | 2004-07-28 | Paper |
Equitable Colourings of d-degenerate Graphs
Combinatorics, Probability and Computing | 2003-06-13 | Paper |
