| Forbidden subgraphs for existences of (connected) 2-factors of a graph. | 0 | 0.34 | 2023 |
| Two completely independent spanning trees of claw-free graphs | 0 | 0.34 | 2022 |
| A note on 3-connected hourglass-free claw-free Hamilton-connected | 0 | 0.34 | 2022 |
| Supereulerian line graphs | 0 | 0.34 | 2022 |
| Hamiltonian Extendable Graphs | 0 | 0.34 | 2022 |
| Forbidden pairs of disconnected graphs for 2-factor of connected graphs | 0 | 0.34 | 2022 |
| Characterizing Forbidden Pairs for the Edge-Connectivity of a Connected Graph to Be Its Minimum Degree | 0 | 0.34 | 2022 |
| Forbidden Subgraphs for Collapsible Graphs and Supereulerian Graphs | 0 | 0.34 | 2022 |
| The Independence Number Conditions for 2-Factors of a Claw-Free Graph | 0 | 0.34 | 2022 |
| Forbidden Pairs of Disconnected Graphs for Traceability of Block-Chains | 0 | 0.34 | 2022 |
| Edge Degree Conditions for 2-Iterated Line Graphs to Be Traceable. | 0 | 0.34 | 2022 |
| Characterizing forbidden pairs for relative length of longest paths and cycles | 0 | 0.34 | 2022 |
| Strongly Spanning Trailable Graphs With Small Circumference And Hamilton-Connected Claw-Free Graphs | 0 | 0.34 | 2021 |
| Forbidden Subgraphs For Supereulerian And Hamiltonian Graphs | 0 | 0.34 | 2021 |
| Circumference Of A Graph And Its Distance Dominating Longest Cycles | 0 | 0.34 | 2021 |
| 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices | 0 | 0.34 | 2020 |
| Forbidden subgraphs on Hamiltonian index | 0 | 0.34 | 2020 |
| Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3 | 0 | 0.34 | 2020 |
| Forbidden Subgraphs for a Graph to Have a Hamiltonian Path Square | 0 | 0.34 | 2020 |
| On sufficient degree conditions for traceability of claw-free graphs | 0 | 0.34 | 2020 |
| A Note on Singular Edges and Hamiltonicity in Claw-Free Graphs with Locally Disconnected Vertices | 0 | 0.34 | 2020 |
| The Local Structure of Claw-Free Graphs Without Induced Generalized Bulls. | 0 | 0.34 | 2019 |
| On the independence number of traceable 2-connected claw-free graphs | 0 | 0.34 | 2019 |
| Reciprocal degree distance and graph properties. | 0 | 0.34 | 2019 |
| Forbidden Pairs for Equality of Connectivity and Edge-Connectivity of Graphs. | 0 | 0.34 | 2019 |
| Number of vertices of degree three in spanning 3-trees in square graphs. | 0 | 0.34 | 2019 |
| Spanning Trails in a 2-Connected Graph | 0 | 0.34 | 2019 |
| Large Degree Vertices In Longest Cycles Of Graphs, Ii | 0 | 0.34 | 2019 |
| Some results on the inverse sum indeg index of a graph. | 3 | 0.47 | 2018 |
| Erratum to "Forbidden pairs for spanning (closed) trails" [Discrete Math. 340 (2017) 1012-1018]. | 2 | 0.40 | 2018 |
| Pairs of forbidden subgraphs and 2-connected supereulerian graphs. | 1 | 0.37 | 2018 |
| Traceability on 2-connected line graphs. | 1 | 0.35 | 2018 |
| Hamiltonian properties of 3-connected {claw, hourglass}-free graphs. | 1 | 0.41 | 2018 |
| Characterization of forbidden subgraphs for the existence of even factors in a graph. | 0 | 0.34 | 2017 |
| Extremal polyomino chains with respect to general sum-connectivity index. | 0 | 0.34 | 2017 |
| Connected Even Factors in the Square of Essentially 2-Edge-connected Graph. | 0 | 0.34 | 2017 |
| Forbidden set of induced subgraphs for 2-connected supereulerian graphs. | 0 | 0.34 | 2017 |
| Forbidden pairs of disconnected graphs for traceability in connected graphs. | 0 | 0.34 | 2017 |
| Forbidden pairs for spanning (closed) trails. | 4 | 0.60 | 2017 |
| Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs. | 3 | 0.42 | 2017 |
| The Ryjáček closure and a forbidden subgraph. | 0 | 0.34 | 2016 |
| Large degree vertices in longest cycles of graphs, I. | 1 | 0.36 | 2016 |
| Extremal polyomino chains with respect to general Randić index | 2 | 0.42 | 2016 |
| Hamiltonian Claw-Free Graphs and o-Heavy Graphs Involving Induced Cycles | 0 | 0.34 | 2016 |
| Maximally edge-connected graphs and Zeroth-order general Randić index for α ≤ -1. | 3 | 0.44 | 2016 |
| Closure and Hamilton-Connected Claw-Free Hourglass-Free Graphs | 0 | 0.34 | 2015 |
| An Extension of the Chvátal-Erdős Theorem: Counting the Number of Maximum Independent Sets. | 0 | 0.34 | 2015 |
| The Chvátal-Erdős Condition for a Graph to Have a Spanning Trail. | 2 | 0.41 | 2015 |
| On Traceable Line Graphs | 0 | 0.34 | 2015 |
| Hamiltonian claw-free graphs with locally disconnected vertices | 0 | 0.34 | 2015 |
