| Publication | Date of Publication | Type |
|---|
Minimum k-critical-bipartite graphs: the irregular case
Opuscula Mathematica | 2026-04-20 | Paper |
k-fault-tolerant graphs for p disjoint complete graphs of order c
Discussiones Mathematicae. Graph Theory | 2025-05-12 | Paper |
| k-fault-tolerant graphs for p disjoint complete graphs of order c | 2022-12-13 | Paper |
Upper bounds on distance vertex irregularity strength of some families of graphs
Opuscula Mathematica | 2022-07-15 | Paper |
Upper bounds on inclusive distance vertex irregularity strength
Graphs and Combinatorics | 2021-11-30 | Paper |
\( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs
Discussiones Mathematicae Graph Theory | 2021-07-21 | Paper |
A note on packing two copies of a tree into a graph with small maximum degree
Discrete Mathematics | 2020-08-12 | Paper |
Anti-Ramsey numbers for disjoint copies of graphs
Opuscula Mathematica | 2018-10-23 | Paper |
Constant sum partition of sets of integers and distance magic graphs
Discussiones Mathematicae Graph Theory | 2018-01-10 | Paper |
On Erdős-Sós conjecture for trees of large size
The Electronic Journal of Combinatorics | 2016-05-03 | Paper |
Cordial labeling of hypertrees
Discrete Mathematics | 2014-01-24 | Paper |
Sparse graphs of girth at least five are packable
Discrete Mathematics | 2012-11-20 | Paper |
A lower bound on the size of \((H;1)\)-vertex stable graphs
Discrete Mathematics | 2012-10-16 | Paper |
On \((C_n;k)\) stable graphs
The Electronic Journal of Combinatorics | 2011-11-22 | Paper |
Open trails in digraphs
Opuscula Mathematica | 2011-10-12 | Paper |
On packable digraphs
SIAM Journal on Discrete Mathematics | 2011-04-15 | Paper |
Edge-disjoint open trails in complete bipartite multigraphs
Graphs and Combinatorics | 2010-11-12 | Paper |
A note on an embedding problem in transitive tournaments
Discrete Mathematics | 2010-04-27 | Paper |
A note on packing graphs without cycles of length up to five
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
A note on packing graphs without cycles of length up to five
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
| Planar packing of cycles and unicyclic graphs | 2010-02-08 | Paper |
| A note on k-cordial p-uniform hypertrees | 2009-10-13 | Paper |
| Decompositions of complete multigraphs into open trails | 2009-01-15 | Paper |
Arbitrarily vertex decomposable caterpillars with four or five leaves
Discussiones Mathematicae Graph Theory | 2008-07-01 | Paper |
| A note on decompositions of transitive tournaments. II | 2007-07-26 | Paper |
Decomposition of complete bipartite graphs into open trails
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Fixed-point-free embeddings of digraphs with small size
Discrete Mathematics | 2007-04-26 | Paper |
A note on decompositions of transitive tournaments
Discrete Mathematics | 2007-03-02 | Paper |
A note on a packing problem in transitive tournaments
Graphs and Combinatorics | 2006-09-12 | Paper |
A note on embedding graphs without short cycles
Discrete Mathematics | 2004-10-01 | Paper |
On cyclically embeddable (n,n)-graphs
Discussiones Mathematicae Graph Theory | 2004-03-25 | Paper |
