| Publication | Date of Publication | Type |
|---|
An efficient algorithm to compute the toughness in graphs with bounded treewidth
Graphs and Combinatorics | 2024-10-09 | Paper |
Minimal toughness in special graph classes
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-06 | Paper |
| Towards a Baranyai theorem with additional condition | 2023-12-14 | Paper |
| On minimally tough chordal graphs | 2022-10-01 | Paper |
| Minimally tough chordal graphs with toughness at most $1/2$ | 2022-09-01 | Paper |
Optimal pebbling and rubbling of graphs with given diameter
Discrete Applied Mathematics | 2021-05-19 | Paper |
Optimal pebbling and rubbling of graphs with given diameter
Discrete Applied Mathematics | 2021-05-19 | Paper |
Optimal pebbling number of the square grid
Graphs and Combinatorics | 2020-04-30 | Paper |
| Strengthening some complexity results on toughness of graphs | 2019-10-19 | Paper |
The optimal pebbling number of staircase graphs
Discrete Mathematics | 2019-06-18 | Paper |
The optimal pebbling number of staircase graphs
Discrete Mathematics | 2019-06-18 | Paper |
Optimal pebbling number of graphs with given minimum degree
Discrete Applied Mathematics | 2019-05-03 | Paper |
Optimal pebbling number of graphs with given minimum degree
Discrete Applied Mathematics | 2019-05-03 | Paper |
Decomposition of a graph into two disjoint odd subgraphs
Graphs and Combinatorics | 2019-01-11 | Paper |
Decomposition of a graph into two disjoint odd subgraphs
Graphs and Combinatorics | 2019-01-11 | Paper |
Properties of minimally \(t\)-tough graphs
Discrete Mathematics | 2017-10-24 | Paper |
A lower bound for graph energy of fullerenes
Distance, Symmetry, and Topology in Carbon Nanomaterials | 2017-04-27 | Paper |
Hypergraph extensions of the Erdős-Gallai theorem
European Journal of Combinatorics | 2016-08-16 | Paper |
| Extremal \(k\)-edge-Hamiltonian hypergraphs | 2016-07-01 | Paper |
SIS epidemic propagation on hypergraphs
Bulletin of Mathematical Biology | 2016-06-30 | Paper |
SIS epidemic propagation on hypergraphs
Bulletin of Mathematical Biology | 2016-06-30 | Paper |
The optimal rubbling number of ladders, prisms and Möbius-ladders
Discrete Applied Mathematics | 2016-06-21 | Paper |
| Extension of paths and cycles for hypergraphs | 2016-04-29 | Paper |
Bounds on the number of edges in hypertrees
Discrete Mathematics | 2016-04-27 | Paper |
| Constructions for the optimal pebbling of grids | 2016-01-10 | Paper |
Centrosymmetric graphs and a lower bound for graph energy of fullerenes
Discussiones Mathematicae Graph Theory | 2014-11-18 | Paper |
| Bounds on the rubbling and optimal rubbling numbers of graphs | 2013-11-01 | Paper |
Bounds on the rubbling and optimal rubbling numbers of graphs
Graphs and Combinatorics | 2013-06-26 | Paper |
Most probably intersecting families of subsets
Combinatorics, Probability and Computing | 2012-05-14 | Paper |
Hypergraph extensions of the Erdős-Gallai theorem
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Extremal \(P_4\)-stable graphs
Discrete Applied Mathematics | 2011-10-27 | Paper |
| scientific article; zbMATH DE number 5763213 (Why is no real title available?) | 2010-07-30 | Paper |
Elementary graphs with respect to \(f\)-parity factors
Graphs and Combinatorics | 2010-05-05 | Paper |
Hamilton-chain saturated hypergraphs
Discrete Mathematics | 2010-04-27 | Paper |
Extremal \(k\)-edge-Hamiltonian hypergraphs
Discrete Mathematics | 2008-03-18 | Paper |
Local topological toughness and local factors
Graphs and Combinatorics | 2007-10-11 | Paper |
Extremal k-edge-hamiltonian Hypergraphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Hamiltonian Chains in Hypergraphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Structure theorem and algorithm on \((1,f)\)-odd subgraph
Discrete Mathematics | 2007-04-26 | Paper |
Hamiltonian path saturated graphs with small size
Discrete Applied Mathematics | 2006-06-09 | Paper |
| scientific article; zbMATH DE number 2230241 (Why is no real title available?) | 2005-11-18 | Paper |
Packing paths of length at least two
Discrete Mathematics | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 1960287 (Why is no real title available?) | 2003-08-06 | Paper |
Odd subgraphs and matchings
Discrete Mathematics | 2002-08-29 | Paper |
A large set of non-Hamiltonian graphs
Discrete Applied Mathematics | 2002-07-22 | Paper |
Properties of edge-tough graphs
Graphs and Combinatorics | 2000-02-16 | Paper |
Chordality and 2-factors in tough graphs
Discrete Applied Mathematics | 2000-01-30 | Paper |
| Hamiltonian chains in hypergraphs | 1999-11-03 | Paper |
Edge disjoint Polyp Packing
Discrete Applied Mathematics | 1998-06-11 | Paper |
Toughness and edge-toughness
Discrete Mathematics | 1997-11-09 | Paper |
Searching for \(f\)-Hamiltonian circuits
Combinatorica | 1992-12-14 | Paper |
Minimal toughness in special graph classes
(available as arXiv preprint) | N/A | Paper |
