| Two sufficient conditions for a planar graph to be list vertex-2-arborable | 0 | 0.34 | 2022 |
| A sufficient condition for a planar graph to be (F, F2)-partitionable | 0 | 0.34 | 2022 |
| Strong Chromatic Index of Outerplanar Graphs | 0 | 0.34 | 2022 |
| Structure and pancyclicity of maximal planar graphs with diameter two | 0 | 0.34 | 2022 |
| Star Chromatic Index of 1-Planar Graphs | 0 | 0.34 | 2022 |
| Strict Neighbor-Distinguishing Index Of Subcubic Graphs | 0 | 0.34 | 2021 |
| Tight binding number bound for P ≥3-factor uniform graphs | 0 | 0.34 | 2021 |
| Plane Graphs Of Maximum Degree Delta >= 7 Are Edge-Face (Delta+1)-Colorable | 0 | 0.34 | 2020 |
| Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve | 0 | 0.34 | 2020 |
| Adjacent Vertex Distinguishing Edge Coloring Of Planar Graphs Without 3-Cycles | 0 | 0.34 | 2020 |
| Light structures in 1-planar graphs with an application to linear 2-arboricity | 0 | 0.34 | 2019 |
| Planar graphs with $$\Delta =9$$Δ=9 are neighbor-distinguishing totally 12-colorable | 0 | 0.34 | 2019 |
| Acyclic coloring of IC-planar graphs. | 0 | 0.34 | 2019 |
| List coloring and diagonal coloring for plane graphs of diameter two. | 0 | 0.34 | 2019 |
| A note on the list vertex arboricity of toroidal graphs. | 0 | 0.34 | 2018 |
| Planar graphs without chordal 6-cycles are 4-choosable. | 0 | 0.34 | 2018 |
| Planar graphs with maximum degree 4 are strongly 19-edge-colorable. | 0 | 0.34 | 2018 |
| The neighbor expanded sum distinguishing index of Halin graphs. | 0 | 0.34 | 2018 |
| Edge-partition and star chromatic index. | 2 | 0.40 | 2018 |
| Planar graphs without chordal 5-cycles are 2-good. | 1 | 0.36 | 2018 |
| A characterization for the neighbor-distinguishing total chromatic number of planar graphs with Δ=13. | 0 | 0.34 | 2018 |
| Strong chromatic index of K4-minor free graphs. | 0 | 0.34 | 2018 |
| On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree. | 0 | 0.34 | 2018 |
| 2-Distance Vertex-Distinguishing Total Coloring Of Graphs | 0 | 0.34 | 2018 |
| 2-Distance vertex-distinguishing index of subcubic graphs. | 1 | 0.36 | 2018 |
| A note on the linear 2-arboricity of planar graphs. | 1 | 0.38 | 2017 |
| A sufficient condition for planar graphs to be (3, 1)-choosable | 0 | 0.34 | 2017 |
| The chromatic number of the square of a Halin graph with maximum degree five is six. | 0 | 0.34 | 2017 |
| The entire chromatic number of graphs embedded on the torus with large maximum degree. | 1 | 0.36 | 2017 |
| List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles. | 1 | 0.37 | 2016 |
| A sufficient condition for a tree to be (Δ+1)-(2, 1)-totally labelable. | 0 | 0.34 | 2016 |
| Rainbow cliques in edge-colored graphs. | 5 | 0.47 | 2016 |
| The entire choosability of plane graphs | 1 | 0.37 | 2016 |
| A (3, 1) ∗-choosable theorem on planar graphs. | 0 | 0.34 | 2016 |
| The 2-surviving rate of planar graphs without 5-cycles. | 4 | 0.43 | 2016 |
| Legally $$\\varDelta +2$$Δ+2-Coloring Bipartite Outerplanar Graphs in Cubic Time | 0 | 0.34 | 2015 |
| The Vertex Version of Weighted Wiener Number for Bicyclic Molecular Structures. | 2 | 0.41 | 2015 |
| Full Orientability of the Square of a Cycle. | 0 | 0.34 | 2015 |
| A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree. | 3 | 0.47 | 2015 |
| The adjacent vertex distinguishing total coloring of planar graphs | 23 | 1.39 | 2014 |
| The 2-surviving rate of planar graphs without 6-cycles | 8 | 0.53 | 2014 |
| Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable | 2 | 0.38 | 2014 |
| An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph | 4 | 0.57 | 2014 |
| The surviving rate of digraphs | 6 | 0.57 | 2014 |
| A lower bound of the surviving rate of a planar graph with girth at least seven | 8 | 0.55 | 2014 |
| Acyclic list edge coloring of outerplanar graphs. | 0 | 0.34 | 2013 |
| 6-Star-Coloring of Subcubic Graphs | 6 | 1.03 | 2013 |
| The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle | 1 | 0.35 | 2013 |
| Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4. | 4 | 0.41 | 2013 |
| An improved bound on parity vertex colourings of outerplane graphs. | 1 | 0.35 | 2012 |
