| Publication | Date of Publication | Type |
|---|
| On chromatic number and minimum cut | 2019-11-21 | Paper |
| A generalization of Gale's lemma | 2018-07-13 | Paper |
| Altermatic number of categorical product of graphs | 2018-04-05 | Paper |
| Chromatic number of random Kneser hypergraphs | 2017-11-09 | Paper |
| Chromatic number via Turán number | 2017-08-01 | Paper |
| Strengthening topological colorful results for graphs | 2017-06-23 | Paper |
| Hedetniemi's conjecture for Kneser hypergraphs | 2016-08-01 | Paper |
| A Note on Altermatic Number | 2015-10-23 | Paper |
| On the chromatic number of general Kneser hypergraphs | 2015-08-21 | Paper |
| Secure Frameproof Code Through Biclique Cover | 2014-03-25 | Paper |
| Hedetniemi's Conjecture Via Altermatic Number | 2014-03-18 | Paper |
| On the circular chromatic number of graph powers | 2014-01-28 | Paper |
| Some new bounds for cover-free families through biclique covers | 2012-11-20 | Paper |
| A generalization of Kneser's conjecture | 2012-04-13 | Paper |
| scientific article; zbMATH DE number 6007698 (Why is no real title available?) | 2012-02-20 | Paper |
| On connected colourings of graphs. | 2011-02-02 | Paper |
| On the isoperimetric spectrum of graphs and its approximations | 2010-06-03 | Paper |
| Circular coloring and Mycielski construction | 2010-05-05 | Paper |
| On the b-chromatic number of Kneser graphs | 2010-05-05 | Paper |
| Bounds for visual cryptography schemes | 2010-05-05 | Paper |
| Graph powers and graph homomorphisms | 2010-03-26 | Paper |
| A generalization of the Erdős-Ko-Rado theorem | 2009-12-15 | Paper |
| On colorings of graph powers | 2009-12-10 | Paper |
| Density and power graphs in graph homomorphism problem | 2008-07-11 | Paper |
| Circular colouring and algebraic no-homomorphism theorems | 2007-07-27 | Paper |
| On defining numbers of circular complete graphs | 2007-02-13 | Paper |
| Graph homomorphisms and nodal domains | 2006-11-15 | Paper |
| Tabular graphs and chromatic sum | 2005-12-29 | Paper |
| Unique list-colourability and the fixing chromatic number of graphs | 2005-12-27 | Paper |
| scientific article; zbMATH DE number 2151249 (Why is no real title available?) | 2005-04-04 | Paper |
| Sparse \(H\)-colourable graphs of bounded maximum degree | 2004-12-13 | Paper |
| Graph homomorphisms through random walks | 2003-11-10 | Paper |
| Circular chromatic number and Mycielski construction | 2003-10-29 | Paper |
| Circular chromatic number of subgraphs | 2003-10-29 | Paper |
| Circular chromatic number of Kneser graphs | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1802818 (Why is no real title available?) | 2002-11-12 | Paper |
| Uniquely 2-list colorable graphs | 2002-08-29 | Paper |
| scientific article; zbMATH DE number 1792608 (Why is no real title available?) | 2002-08-29 | Paper |
| Minimal coloring and strength of graphs | 2001-03-15 | Paper |
| scientific article; zbMATH DE number 1229629 (Why is no real title available?) | 1998-12-06 | Paper |
| scientific article; zbMATH DE number 1229609 (Why is no real title available?) | 1998-12-06 | Paper |
| Uniquely total colorable graphs | 1998-10-25 | Paper |
