| Publication | Date of Publication | Type |
|---|
Ore-type conditions for existence of a jellyfish in a graph
Journal of Graph Theory | 2026-03-03 | 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 |
| A hypergraph analog of Dirac's Theorem for long cycles in 2-connected graphs, II: Large uniformities | 2023-10-19 | Paper |
Longest cycles in 3‐connected hypergraphs and bipartite 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 |
Induced Turán problems and traces of hypergraphs
European Journal of Combinatorics | 2023-07-18 | Paper |
Induced Turán problems and traces of hypergraphs
European Journal of Combinatorics | 2023-07-18 | Paper |
| On a property of $2$-connected graphs and Dirac's Theorem | 2022-12-13 | Paper |
Towards the small quasi-kernel conjecture
The Electronic Journal of Combinatorics | 2022-10-06 | Paper |
| Dirac's Theorem for hamiltonian Berge cycles in uniform hypergraphs | 2021-09-26 | Paper |
Avoiding long Berge cycles. II: Exact bounds for all \(n\)
Journal of Combinatorics | 2021-07-23 | Paper |
Large monochromatic components in almost complete graphs and bipartite graphs
The Electronic Journal of Combinatorics | 2021-06-21 | Paper |
Forbidding \(K_{2,t}\) traces in triple systems
The Electronic Journal of Combinatorics | 2021-04-12 | Paper |
Conditions for a bigraph to be super-cyclic
The Electronic Journal of Combinatorics | 2021-01-29 | Paper |
Super-pancyclic hypergraphs and bipartite graphs
Journal of Combinatorial Theory. Series B | 2020-09-24 | Paper |
Berge cycles in non-uniform hypergraphs
The Electronic Journal of Combinatorics | 2020-07-30 | Paper |
On \(r\)-uniform hypergraphs with circumference less than \(r\)
Discrete Applied Mathematics | 2020-04-01 | 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 |
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 |
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 |
Extensions of a theorem of Erdős on nonhamiltonian graphs
Journal of Graph Theory | 2018-10-31 | Paper |
Stability in the Erdős-Gallai theorem on cycles and paths. II
Discrete Mathematics | 2018-04-05 | Paper |
A forest building process on simple graphs
Discrete Mathematics | 2017-12-20 | Paper |
The maximum number of cliques in graphs without long cycles
Journal of Combinatorial Theory. Series B | 2017-11-28 | 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 |
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 |
