| Partitioning ordered hypergraphs | 0 | 0.34 | 2021 |
| On 2-defective DP-colorings of sparse graphs | 0 | 0.34 | 2021 |
| 3-regular graphs are 2-reconstructible | 0 | 0.34 | 2021 |
| Conditions For A Bigraph To Be Super-Cyclic | 0 | 0.34 | 2021 |
| Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices | 0 | 0.34 | 2020 |
| Fractional DP-colorings of sparse graphs | 0 | 0.34 | 2020 |
| The Minimum Number of Edges in 4-Critical Digraphs of Given Order | 0 | 0.34 | 2020 |
| Berge cycles in non-uniform hypergraphs | 0 | 0.34 | 2020 |
| The minimum spectral radius of Kr+1-saturated graphs | 0 | 0.34 | 2020 |
| DP-colorings of hypergraphs. | 0 | 0.34 | 2019 |
| A variation of a theorem by Pósa. | 0 | 0.34 | 2019 |
| Cubic graphs with small independence ratio | 0 | 0.34 | 2019 |
| Directed Intersection Representations And The Information Content Of Digraphs | 0 | 0.34 | 2019 |
| Largest 2-Regular Subgraphs in 3-Regular Graphs | 0 | 0.34 | 2019 |
| Sharp Dirac's theorem for DP-critical graphs. | 5 | 0.51 | 2018 |
| Stability in the Erdős-Gallai Theorem on cycles and paths, II. | 0 | 0.34 | 2018 |
| Strong edge-colorings of sparse graphs with large maximum degree. | 1 | 0.42 | 2018 |
| A Brooks-Type Result for Sparse Critical Graphs. | 0 | 0.34 | 2018 |
| List star edge-coloring of subcubic graphs. | 0 | 0.34 | 2018 |
| Strengthening Theorems of Dirac and Erdős on Disjoint Cycles. | 2 | 0.39 | 2017 |
| On the Corrádi-Hajnal theorem and a question of Dirac. | 0 | 0.34 | 2017 |
| A stability version for a theorem of Erdős on nonhamiltonian graphs. | 2 | 0.41 | 2017 |
| Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2. | 0 | 0.34 | 2017 |
| DP-colorings of graphs with high chromatic number. | 3 | 0.42 | 2017 |
| Tight Descriptions of 3-Paths in Normal Plane Maps : Dedicated to Andre Raspaud on the occasion of his 70th birthday. | 2 | 0.39 | 2017 |
| Adding Edges to Increase the Chromatic Number of a Graph. | 0 | 0.34 | 2016 |
| Strong chromatic index of subcubic planar multigraphs | 6 | 0.70 | 2016 |
| On a packing problem of Alon and Yuster. | 0 | 0.34 | 2016 |
| Turán problems and shadows I: Paths and cycles. | 1 | 0.40 | 2015 |
| On independent sets in hypergraphs | 3 | 0.51 | 2014 |
| Ks,t Minors in s+t- Chromatic Graphs, II | 0 | 0.34 | 2014 |
| Maximum hypergraphs without regular subgraphs. | 1 | 0.37 | 2014 |
| Choosability with Separation of Complete Multipartite Graphs and Hypergraphs. | 2 | 0.43 | 2014 |
| Improper coloring of sparse graphs with a given girth, I: (0, 1)-colorings of triangle-free graphs. | 1 | 0.39 | 2014 |
| On Coloring of Sparse Graphs. | 0 | 0.34 | 2013 |
| On Perfect Packings in Dense Graphs. | 5 | 0.53 | 2013 |
| On almost (k-1)-degenerate (k+1)-chromatic graphs and hypergraphs. | 0 | 0.34 | 2013 |
| A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge. | 1 | 0.36 | 2013 |
| Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree. | 9 | 0.73 | 2013 |
| On 11-improper 22-coloring of sparse graphs. | 15 | 0.89 | 2013 |
| Describing 3-paths in normal plane maps. | 12 | 0.97 | 2013 |
| Hypergraph Ramsey numbers: Triangles versus cliques. | 4 | 0.44 | 2013 |
| Equitable List Coloring of Graphs with Bounded Degree. | 1 | 0.37 | 2013 |
| Coloring some finite sets in Rn . | 0 | 0.34 | 2013 |
| Packing and Covering Triangles in K 4-free Planar Graphs. | 1 | 0.37 | 2012 |
| Harmonious coloring of trees with large maximum degree | 2 | 0.41 | 2012 |
| Graphs Containing Every 2-Factor. | 6 | 0.51 | 2012 |
| On Ks, t-minors in graphs with given average degree, II. | 0 | 0.34 | 2012 |
| Ohba's conjecture for graphs with independence number five | 5 | 0.47 | 2011 |
| Large minors in graphs with given independence number | 2 | 0.37 | 2011 |
