| Publication | Date of Publication | Type |
|---|
On 2-distance \(( 2 \Delta + 6)\)-coloring of planar graphs
Discrete Applied Mathematics | 2026-03-05 | Paper |
List 3-dynamic colorings of planar graphs
Discrete Applied Mathematics | 2026-01-28 | Paper |
| Dimensionality reduction with entropies from \(f\)-divergences | 2026-01-28 | Paper |
A sufficient condition for planar graphs with girth 5 to be \((2, 4)\)-colorable
Discrete Applied Mathematics | 2025-12-11 | Paper |
Facial entire coloring of \(K_4\)-minor-free graphs
Utilitas Mathematica | 2025-10-06 | Paper |
Choosability with union separation of planar graphs without intersecting triangles
Applied Mathematics and Computation | 2025-10-02 | Paper |
Testing for error correlation in semi-functional linear models
Journal of Systems Science and Complexity | 2024-08-29 | Paper |
A sufficient condition for planar graphs with girth 5 to be \((1,6)\)-colorable
Applied Mathematics and Computation | 2024-08-12 | Paper |
Partitioning planar graph of girth 5 into two forests with maximum degree 4.
Czechoslovak Mathematical Journal | 2024-08-07 | Paper |
On the cyclic coloring of subcubic plane graphs
Advances in Mathematics (Beijing) | 2024-07-29 | Paper |
The existence of \((F,F_3)\)-partition for toroidal graphs without 4- and 7-cycles
Advances in Mathematics (Beijing) | 2024-07-29 | Paper |
An (F1,F4)‐partition of graphs with low genus and girth at least 6
Journal of Graph Theory | 2023-10-04 | Paper |
2-distance choosability of planar graphs with a restriction for maximum degree
Applied Mathematics and Computation | 2023-04-21 | Paper |
An \((F_3,F_5)\)-partition of planar graphs with girth at least 5
Discrete Mathematics | 2022-11-23 | Paper |
| A \((1,0)\)-relaxed strong list coloring of planar subcubic graphs | 2022-09-29 | Paper |
Planar graphs without cycles of length 4 or 9 are $\boldsymbol{(2,~0,~0)}$-colorable
SCIENTIA SINICA Mathematica | 2022-03-21 | Paper |
Vertex-arboricity of toroidal graphs without \(K_5^-\) and \(6\)-cycles
Discrete Applied Mathematics | 2022-02-09 | Paper |
| Weakly entire coloring of outerplanar graphs | 2021-09-29 | Paper |
| scientific article; zbMATH DE number 7366688 (Why is no real title available?) | 2021-07-01 | Paper |
On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9
Discrete Mathematics | 2021-06-14 | Paper |
| A note on strong edge choosability of toroidal subcubic graphs | 2021-05-28 | Paper |
| Weakly vertex-edge coloring of Halin graphs | 2021-04-26 | Paper |
| Weakly edge-face coloring of outer plane graphs | 2020-10-27 | Paper |
Acyclic 4-choosability of planar graphs without 4-cycles.
Czechoslovak Mathematical Journal | 2020-07-02 | Paper |
Facial edge-face coloring of \(K_4\)-minor-free graphs
Discrete Mathematics | 2020-04-21 | Paper |
List vertex-arboricity of planar graphs without intersecting 5-cycles
Acta Mathematicae Applicatae Sinica. English Series | 2020-04-15 | Paper |
Choosability with separation of planar graphs without prescribed cycles
Applied Mathematics and Computation | 2020-01-15 | Paper |
\((1, 0)\)-relaxed strong edge list coloring of planar graphs with girth \(6\)
Discrete Mathematics, Algorithms and Applications | 2020-01-02 | Paper |
Acyclic improper choosability of subcubic graphs
Applied Mathematics and Computation | 2019-11-29 | Paper |
On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree
Applied Mathematics and Computation | 2019-06-21 | Paper |
| Weakly edge-face coloring of Halin graphs | 2019-02-22 | Paper |
A note on the list vertex arboricity of toroidal graphs
Discrete Mathematics | 2018-10-23 | Paper |
2-distance vertex-distinguishing index of subcubic graphs
Journal of Combinatorial Optimization | 2018-07-26 | Paper |
On choosability with separation of planar graphs without adjacent short cycles
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2018-07-24 | Paper |
Planar graphs with maximum degree 4 are strongly 19-edge-colorable
Discrete Mathematics | 2018-04-19 | Paper |
Acyclic 4-choosability of planar graphs without intersecting short cycles
Discrete Mathematics, Algorithms and Applications | 2018-02-23 | Paper |
A sufficient condition for planar graphs to be (3,1)-choosable
Journal of Combinatorial Optimization | 2017-11-09 | Paper |
A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable
Journal of Combinatorial Optimization | 2017-06-22 | Paper |
| scientific article; zbMATH DE number 6718589 (Why is no real title available?) | 2017-05-17 | Paper |
Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
A \((3,1)^\ast\)-choosable theorem on planar graphs
Journal of Combinatorial Optimization | 2016-10-12 | Paper |
Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable
Discrete Mathematics | 2016-08-16 | Paper |
Planar graphs without 4-cycles adjacent to triangles are 4-choosable
Discrete Mathematics | 2016-08-16 | Paper |
List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles
Discrete Mathematics | 2016-06-16 | Paper |
| Toroidal graphs without 3-cycles adjacent to 5-cycles have list vertex-arboricity at most 2 | 2015-08-13 | Paper |
Acyclic 6-choosability of planar graphs without adjacent short cycles
Science China. Mathematics | 2014-12-02 | Paper |
Plane graphs with maximum degree 6 are edge-face 8-colorable
Graphs and Combinatorics | 2014-09-19 | Paper |
On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles
Discrete Applied Mathematics | 2014-09-12 | Paper |
Star list chromatic number of planar subcubic graphs
Journal of Combinatorial Optimization | 2014-06-24 | Paper |
| 8-star-choosability of a graph with maximum average degree less than 3 | 2014-03-25 | Paper |
Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Planar graphs without 4- and 5-cycles are acyclically 4-choosable
Discrete Applied Mathematics | 2013-04-25 | Paper |
6-Star-Coloring of Subcubic Graphs
Journal of Graph Theory | 2013-03-07 | Paper |
Some results on the injective chromatic number of graphs
Journal of Combinatorial Optimization | 2013-01-03 | Paper |
A sufficient condition for planar graphs to be acyclically 5-choosable
Journal of Graph Theory | 2012-06-04 | Paper |
Vertex-arboricity of planar graphs without intersecting triangles
European Journal of Combinatorics | 2012-05-04 | Paper |
Some structural properties of planar graphs and their applications to 3-choosability
Discrete Mathematics | 2012-01-11 | Paper |
Acyclic 4-choosability of planar graphs
Discrete Mathematics | 2011-01-07 | Paper |
Homomorphisms from sparse graphs to the Petersen graph
Discrete Mathematics | 2010-10-18 | Paper |
Acyclic 3-choosability of sparse graphs with girth at least 7
Discrete Mathematics | 2010-10-11 | Paper |
On acyclic 4-choosability of planar graphs without short cycles
Discrete Mathematics | 2010-07-07 | Paper |
On 3-colorable planar graphs without cycles of four lengths
Information Processing Letters | 2010-03-24 | Paper |
Three-coloring planar graphs without short cycles
Information Processing Letters | 2010-01-29 | Paper |
Planar graphs without 4-cycles are acyclically 6-choosable
Journal of Graph Theory | 2009-12-18 | Paper |
On 3-colorable planar graphs without short cycles
Applied Mathematics Letters | 2009-01-29 | Paper |
Acyclic 5-choosability of planar graphs without 4-cycles
Discrete Mathematics | 2009-01-28 | Paper |
Planar graphs without 4, 6, 8-cycles are 3-colorable
Science in China. Series A | 2008-03-11 | Paper |
On 3-colorable planar graphs without prescribed cycles
Discrete Mathematics | 2007-11-27 | Paper |
| scientific article; zbMATH DE number 5027109 (Why is no real title available?) | 2006-05-26 | Paper |
