| Splits with forbidden subgraphs | 0 | 0.34 | 2022 |
| Strong complete minors in digraphs. | 0 | 0.34 | 2022 |
| Bipartite Independence Number In Graphs With Bounded Maximum Degree | 0 | 0.34 | 2021 |
| Induced Ramsey Number For A Star Versus A Fixed Graph | 0 | 0.34 | 2021 |
| A note on saturation for Berge-G hypergraphs | 0 | 0.34 | 2019 |
| Induced Saturation of Graphs | 0 | 0.34 | 2019 |
| A note on Ramsey numbers for Berge-G hyper graphs | 0 | 0.34 | 2019 |
| Induced and Weak Induced Arboricities. | 1 | 0.41 | 2019 |
| Planar Ramsey Graphs. | 0 | 0.34 | 2019 |
| Polychromatic Colorings on the Integers. | 0 | 0.34 | 2019 |
| Polychromatic colorings of complete graphs with respect to 1-, 2-factors and Hamiltonian cycles. | 1 | 0.43 | 2018 |
| Chromatic number of ordered graphs with forbidden ordered subgraphs. | 0 | 0.34 | 2018 |
| The k-strong induced arboricity of a graph. | 1 | 0.40 | 2018 |
| Planar Ramsey graphs. | 0 | 0.34 | 2018 |
| Boolean lattices: Ramsey properties and embeddings | 1 | 0.35 | 2017 |
| Conditions on Ramsey Nonequivalence | 1 | 0.40 | 2017 |
| The Chromatic Number of Ordered Graphs With Constrained Conflict Graphs. | 0 | 0.34 | 2017 |
| A note on adjacent vertex distinguishing colorings of graphs | 4 | 0.41 | 2016 |
| Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths | 3 | 0.40 | 2015 |
| Brooks type results for conflict-free colorings and { a , b } -factors in graphs | 0 | 0.34 | 2015 |
| On the Chromatic Number of Subsets of the Euclidean Plane | 1 | 0.41 | 2014 |
| Multicolor Ramsey numbers for triple systems. | 3 | 0.50 | 2014 |
| Packing polyominoes clumsily | 0 | 0.34 | 2014 |
| Density Of Range Capturing Hypergraphs | 0 | 0.34 | 2014 |
| Twins in graphs | 1 | 0.37 | 2014 |
| Spectrum of Mixed Bi-uniform Hypergraphs. | 0 | 0.34 | 2014 |
| Fork-forests in bi-colored complete bipartite graphs | 0 | 0.34 | 2013 |
| Unavoidable subtrees. | 0 | 0.34 | 2013 |
| Visibility Number of Directed Graphs. | 4 | 0.50 | 2013 |
| Q 2-free Families in the Boolean Lattice. | 7 | 0.61 | 2012 |
| A regularity lemma and twins in words | 6 | 0.61 | 2012 |
| A note on the monotonicity of mixed Ramsey numbers | 1 | 0.36 | 2011 |
| List precoloring extension in planar graphs | 1 | 0.38 | 2011 |
| On homometric sets in graphs. | 3 | 0.45 | 2011 |
| On the structure of minimal winning coalitions in simple voting games | 2 | 0.36 | 2010 |
| ON COLORINGS AVOIDING A RAINBOW CYCLE AND A FIXED MONOCHROMATIC SUBGRAPH | 2 | 0.48 | 2010 |
| Avoiding Rainbow Induced Subgraphs In Edge-Colorings | 0 | 0.34 | 2009 |
| When Do Three Longest Paths Have A Common Vertex? | 3 | 0.54 | 2009 |
| Avoiding rainbow induced subgraphs in vertex-colorings | 5 | 0.65 | 2008 |
| Edge-colorings avoiding rainbow and monochromatic subgraphs | 12 | 1.04 | 2008 |
| On the editing distance of graphs | 14 | 1.06 | 2008 |
| Graphs Having Small Number of Sizes on Induced k-Subgraphs | 4 | 0.53 | 2007 |
| On Weighted Ramsey Numbers | 0 | 0.34 | 2007 |
| Rainbows in the Hypercube | 6 | 0.61 | 2007 |
| On Subgraphs Induced by Transversals in Vertex-Partitions of Graphs | 3 | 0.62 | 2006 |
| Sub-Ramsey Numbers for Arithmetic Progressions | 5 | 0.86 | 2006 |
| A note on short cycles in a hypercube | 6 | 0.62 | 2006 |
| On the Strong Chromatic Number of Graphs | 5 | 0.55 | 2006 |
| Avoiding Patterns in Matrices Via a Small Number of Changes | 5 | 0.66 | 2006 |
| Canonical Pattern Ramsey Numbers | 2 | 0.41 | 2005 |
