| Publication | Date of Publication | Type |
|---|
The robust chromatic number of graphs Graphs and Combinatorics | 2024-09-04 | Paper |
An enumeration approach to network evolution Miskolc Mathematical Notes | 2023-12-12 | Paper |
Connected domination in random graphs Indian Journal of Pure & Applied Mathematics | 2023-07-03 | Paper |
Graphs with equal Grundy domination and independence number Discrete Optimization | 2023-06-30 | Paper |
| The robust chromatic number of graphs | 2023-05-03 | Paper |
| The robust chromatic number of certain graph classes | 2023-05-03 | Paper |
Chromatic uniqueness of zero-divisor graphs The Art of Discrete and Applied Mathematics | 2022-12-19 | Paper |
Integral-root polynomials and chromatic uniqueness of graphs Journal of Discrete Mathematical Sciences and Cryptography | 2022-02-21 | Paper |
The equal-sum-free subset problem Acta Scientiarum Mathematicarum | 2020-10-02 | Paper |
Disjoint paired-dominating sets in cubic graphs Graphs and Combinatorics | 2019-11-06 | Paper |
Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs Algorithmica | 2019-02-14 | Paper |
| H-free graphs, independent sets, and subexponential-time algorithms | 2018-04-10 | Paper |
Coloring the cliques of line graphs Discrete Mathematics | 2017-09-05 | Paper |
Minimum order of graphs with given coloring parameters Discrete Mathematics | 2015-01-23 | Paper |
The 2-blocking number and the upper chromatic number of \(\operatorname{PG}(2,q)\) Journal of Combinatorial Designs | 2014-04-25 | Paper |
Distance domination versus iterated domination Discrete Mathematics | 2012-08-10 | Paper |
| New challenges in the theory of hypergraph coloring | 2011-07-06 | Paper |
Optimal guard sets and the Helly property European Journal of Combinatorics | 2010-11-22 | Paper |
| Clique-transversal sets and weak 2-colorings in graphs of small maximum degree | 2010-07-27 | Paper |
Infinite versus finite graph domination Discrete Mathematics | 2010-05-05 | Paper |
New near-factorizations of finite groups Studia Scientiarum Mathematicarum Hungarica | 2009-12-28 | Paper |
Perfectly orderable graphs and unique colorability Applicable Analysis and Discrete Mathematics | 2009-12-03 | Paper |
Complete description of forbidden subgraphs in the structural domination problem Discrete Mathematics | 2009-06-19 | Paper |
Upper chromatic number of finite projective planes Journal of Combinatorial Designs | 2008-06-05 | Paper |
The cost chromatic number and hypergraph parameters Discussiones Mathematicae Graph Theory | 2008-01-18 | Paper |
Characterization of graphs dominated by induced paths Discrete Mathematics | 2007-03-02 | Paper |
Graph Domination in Distance Two Discussiones Mathematicae Graph Theory | 2005-09-12 | Paper |
Dominating Bipartite Subgraphs in Graphs Discussiones Mathematicae Graph Theory | 2005-09-12 | Paper |
| scientific article; zbMATH DE number 2188424 (Why is no real title available?) | 2005-07-26 | Paper |
Graphs without induced P5and C5 Discussiones Mathematicae Graph Theory | 2005-04-19 | Paper |
Coloring the Maximal Cliques of Graphs SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
| scientific article; zbMATH DE number 1933047 (Why is no real title available?) | 2003-09-05 | Paper |
Independence, irredundance, degrees and chromatic number in graphs Discrete Mathematics | 2003-03-16 | Paper |
Elementary bipartite graphs and unique colourability European Journal of Combinatorics | 2002-09-04 | Paper |
| scientific article; zbMATH DE number 1286503 (Why is no real title available?) | 1999-08-31 | Paper |
| scientific article; zbMATH DE number 1247724 (Why is no real title available?) | 1999-02-02 | Paper |
On a conjecture about uniquely colorable perfect graphs Discrete Mathematics | 1998-03-24 | Paper |
Domination properties and induced subgraphs Discrete Mathematics | 1994-03-17 | Paper |
Dominating cliques in \(P_ 5\)-free graphs Periodica Mathematica Hungarica | 1992-06-25 | Paper |
A characterization of graphs without long induced paths Journal of Graph Theory | 1990-01-01 | Paper |