| Publication | Date of Publication | Type |
|---|
Minimal abundant packings and choosability with separation
(available as arXiv preprint) | N/A | Paper |
A hypergraph analog of Dirac's Theorem for long cycles in 2-connected graphs
(available as arXiv preprint) | N/A | Paper |
Ore-type conditions for existence of a jellyfish in a graph
(available as arXiv preprint) | N/A | Paper |
A lower bound on the number of edges in DP-critical graphs
Journal of Combinatorial Theory. Series B | 2026-06-16 | Paper |
Ore-type conditions for existence of a jellyfish in a graph
Journal of Graph Theory | 2026-03-03 | Paper |
Equitable list coloring of sparse graphs
Discrete Mathematics | 2026-02-16 | Paper |
Turán number for bushes
The Electronic Journal of Combinatorics | 2026-02-04 | Paper |
Trees with at least 6 +11 vertices are -reconstructible
Graphs and Combinatorics | 2026-01-29 | Paper |
Sparse critical graphs for defective (1, 3)-coloring
Graphs and Combinatorics | 2025-10-22 | Paper |
Acyclic graphs with at least 2 + 1 vertices are -recognizable
Journal of Graph Theory | 2025-04-23 | Paper |
Equitable list coloring of planar graphs with given maximum degree
Journal of Graph Theory | 2025-03-20 | Paper |
A hypergraph analog of Dirac's theorem for long cycles in 2-connected graphs. II: Large uniformities
The Electronic Journal of Combinatorics | 2025-03-06 | Paper |
Minimal abundant packings and choosability with separation
Designs, Codes and Cryptography | 2024-12-11 | Paper |
A hypergraph analog of Dirac's theorem for long cycles in 2-connected graphs
Combinatorica | 2024-09-19 | Paper |
On a property of 2-connected graphs and Dirac's theorem
Discrete Mathematics | 2024-08-19 | Paper |
Dirac-type theorems for long Berge cycles in hypergraphs
Journal of Combinatorial Theory. Series B | 2024-07-01 | Paper |
Sparse critical graphs for defective DP-colorings
Discrete Mathematics | 2024-03-27 | Paper |
Generalized DP-colorings of graphs
Discrete Mathematics | 2023-11-27 | Paper |
Saturation for the 3-uniform loose 3-cycle
Discrete Mathematics | 2023-11-27 | Paper |
Extremal Problems for Hypergraph Blowups of Trees
SIAM Journal on Discrete Mathematics | 2023-10-26 | Paper |
| A hypergraph analog of Dirac's Theorem for long cycles in 2-connected graphs, II: Large uniformities | 2023-10-19 | Paper |
| Sparse critical graphs for defective (1,3)-coloring | 2023-10-12 | Paper |
Longest cycles in 3‐connected hypergraphs and bipartite graphs
Journal of Graph Theory | 2023-10-05 | Paper |
Monochromatic connected matchings in 2‐edge‐colored multipartite graphs
Journal of Graph Theory | 2023-10-05 | Paper |
Minimum degree ensuring that a hypergraph is Hamiltonian-connected
European Journal of Combinatorics | 2023-10-02 | Paper |
| Equitable list coloring of planar graphs with given maximum degree | 2023-09-02 | Paper |
| Acyclic graphs with at least 2\ell+1 vertices are \ell-recognizable | 2023-08-08 | Paper |
| Trees with at least 6\ell+11 vertices are \ell-reconstructible | 2023-07-19 | Paper |
| Tur\' an number for bushes | 2023-07-10 | Paper |
| Equitable coloring of planar graphs with maximum degree at least eight | 2023-05-19 | Paper |
3-reconstructibility of rooted trees
Pure and Applied Mathematics Quarterly | 2023-04-05 | Paper |
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree
Combinatorics, Probability and Computing | 2023-03-31 | Paper |
| On a property of $2$-connected graphs and Dirac's Theorem | 2022-12-13 | Paper |
A sharp lower bound for the spectral radius in \(K_4\)-saturated graphs
Discrete Mathematics | 2022-11-23 | Paper |
| Sharp lower bounds for the number of maximum matchings in bipartite multigraphs | 2022-11-18 | Paper |
Towards the small quasi-kernel conjecture
The Electronic Journal of Combinatorics | 2022-10-06 | Paper |
A characterization of Seymour graphs
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
Extremal problems for convex geometric hypergraphs and ordered hypergraphs
Canadian Journal of Mathematics | 2022-01-12 | Paper |
Defective DP-colorings of sparse simple graphs
Discrete Mathematics | 2021-10-27 | Paper |
| Disjoint chorded cycles in graphs with high Ore-degree | 2021-10-04 | Paper |
On sizes of 1-cross intersecting set pair systems
Siberian Mathematical Journal | 2021-09-27 | Paper |
| Dirac's Theorem for hamiltonian Berge cycles in uniform hypergraphs | 2021-09-26 | Paper |
Packing \(( 1 , 1 , 2 , 4 )\)-coloring of subcubic outerplanar graphs
Discrete Applied Mathematics | 2021-08-02 | Paper |
Avoiding long Berge cycles. II: Exact bounds for all \(n\)
Journal of Combinatorics | 2021-07-23 | Paper |
On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
Injective edge-coloring of graphs with given maximum degree
European Journal of Combinatorics | 2021-06-18 | Paper |
| Acyclic graphs with at least $2\ell+1$ vertices are $\ell$-recognizable | 2021-03-22 | Paper |
Cut-edges and regular factors in regular graphs of odd degree
Graphs and Combinatorics | 2021-03-17 | Paper |
Cut-edges and regular factors in regular graphs of odd degree
Graphs and Combinatorics | 2021-03-17 | Paper |
3-regular graphs are 2-reconstructible
European Journal of Combinatorics | 2021-02-08 | Paper |
On 2-defective DP-colorings of sparse graphs
European Journal of Combinatorics | 2021-02-08 | Paper |
Defective DP-colorings of sparse multigraphs
European Journal of Combinatorics | 2021-02-08 | Paper |
Conditions for a bigraph to be super-cyclic
The Electronic Journal of Combinatorics | 2021-01-29 | Paper |
Tight paths in convex geometric hypergraphs
Advances in Combinatorics | 2020-10-20 | Paper |
Partitioning ordered hypergraphs
Journal of Combinatorial Theory. Series A | 2020-10-07 | Paper |
Super-pancyclic hypergraphs and bipartite graphs
Journal of Combinatorial Theory. Series B | 2020-09-24 | Paper |
The minimum spectral radius of \(K_{r + 1}\)-saturated graphs
Discrete Mathematics | 2020-09-10 | Paper |
Ordered and convex geometric trees with linear extremal function
Discrete & Computational Geometry | 2020-09-01 | Paper |
On-line DP-coloring of graphs
Discrete Applied Mathematics | 2020-08-31 | Paper |
Berge cycles in non-uniform hypergraphs
The Electronic Journal of Combinatorics | 2020-07-30 | Paper |
| $K_{r+1}$-saturated graphs with small spectral radius | 2020-06-08 | Paper |
Fractional DP-colorings of sparse graphs
Journal of Graph Theory | 2020-05-21 | Paper |
Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices
Graphs and Combinatorics | 2020-04-30 | Paper |
The minimum number of edges in 4-critical digraphs of given order
Graphs and Combinatorics | 2020-04-30 | Paper |
Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 2
Discrete Applied Mathematics | 2020-04-01 | Paper |
On \(r\)-uniform hypergraphs with circumference less than \(r\)
Discrete Applied Mathematics | 2020-04-01 | Paper |
Long monochromatic paths and cycles in 2-edge-colored multipartite graphs
Moscow Journal of Combinatorics and Number Theory | 2020-02-21 | Paper |
Extremal union-closed set families
Graphs and Combinatorics | 2020-01-21 | Paper |
On 2-connected hypergraphs with no long cycles
The Electronic Journal of Combinatorics | 2019-11-15 | Paper |
On 2-connected hypergraphs with no long cycles
The Electronic Journal of Combinatorics | 2019-11-15 | Paper |
Hypergraphs not containing a tight tree with a bounded trunk
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
| An algorithmic answer to the Ore-type version of Dirac's question on disjoint cycles | 2019-07-25 | Paper |
Avoiding long Berge cycles
Journal of Combinatorial Theory. Series B | 2019-07-17 | Paper |
Avoiding long Berge cycles
Journal of Combinatorial Theory. Series B | 2019-07-17 | Paper |
Largest 2-regular subgraphs in 3-regular graphs
Graphs and Combinatorics | 2019-06-28 | Paper |
A variation of a theorem by Pósa
Discrete Mathematics | 2019-06-18 | Paper |
A variation of a theorem by Pósa
Discrete Mathematics | 2019-06-18 | Paper |
DP-colorings of hypergraphs
European Journal of Combinatorics | 2019-06-18 | Paper |
Monochromatic paths and cycles in 2-edge-colored graphs with large minimum degree
(available as arXiv preprint) | 2019-06-06 | Paper |
Packing chromatic number of subdivisions of cubic graphs
Graphs and Combinatorics | 2019-05-03 | Paper |
Cubic graphs with small independence ratio
The Electronic Journal of Combinatorics | 2019-03-22 | Paper |
Cubic graphs with small independence ratio
The Electronic Journal of Combinatorics | 2019-03-22 | Paper |
Many cliques in \(H\)-free subgraphs of random graphs
Journal of Combinatorics | 2018-12-10 | Paper |
Extensions of a theorem of Erdős on nonhamiltonian graphs
Journal of Graph Theory | 2018-10-31 | Paper |
A Brooks-type result for sparse critical graphs
Combinatorica | 2018-09-24 | Paper |
Sharp Dirac's theorem for DP-critical graphs
Journal of Graph Theory | 2018-08-16 | Paper |
List star edge-coloring of subcubic graphs
Discussiones Mathematicae Graph Theory | 2018-08-10 | Paper |
| Extremal problems on ordered and convex geometric hypergraphs | 2018-07-13 | Paper |
A sharp Dirac-Erdős type bound for large graphs
Combinatorics, Probability and Computing | 2018-04-23 | Paper |
Cycles in triangle-free graphs of large chromatic number
Combinatorica | 2018-04-12 | Paper |
Stability in the Erdős-Gallai theorem on cycles and paths. II
Discrete Mathematics | 2018-04-05 | Paper |
Sharpening an ore-type version of the Corrádi-Hajnal theorem
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg | 2018-01-05 | Paper |
Packing chromatic number of cubic graphs
Discrete Mathematics | 2017-12-20 | Paper |
Strong edge-colorings of sparse graphs with large maximum degree
European Journal of Combinatorics | 2017-10-10 | Paper |
Adding edges to increase the chromatic number of a graph
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
A stability version for a theorem of Erdős on nonhamiltonian graphs
Discrete Mathematics | 2017-09-05 | Paper |
A stability version for a theorem of Erdős on nonhamiltonian graphs
Discrete Mathematics | 2017-09-05 | Paper |
| Tight paths in convex geometric hypergraphs | 2017-09-04 | Paper |
DP-colorings of graphs with high chromatic number
European Journal of Combinatorics | 2017-08-31 | Paper |
Strengthening Theorems of Dirac and Erdős on Disjoint Cycles
Journal of Graph Theory | 2017-08-10 | Paper |
On DP-coloring of graphs and multigraphs
Siberian Mathematical Journal | 2017-06-30 | Paper |
Tight descriptions of 3-paths in normal plane maps
Journal of Graph Theory | 2017-06-30 | Paper |
| On differences between DP-coloring and list coloring | 2017-05-13 | Paper |
A refinement of a result of Corrádi and Hajnal
Combinatorica | 2017-03-31 | Paper |
The structure of large intersecting families
Proceedings of the American Mathematical Society | 2017-03-27 | Paper |
On the Corrádi-Hajnal theorem and a question of Dirac
Journal of Combinatorial Theory. Series B | 2016-11-25 | Paper |
