| Publication | Date of Publication | Type |
|---|
| Radio number for the Cartesian product of two trees | 2024-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6116947 | 2023-07-18 | Paper |
| Antimagic labeling for unions of graphs with many three-paths | 2023-04-20 | Paper |
| Radio-\(k\)-labeling of cycles for large \(k\) | 2022-05-30 | Paper |
| Antimagic Labeling for Unions of Graphs with Many Three-Paths | 2022-03-28 | Paper |
| Optimal radio labellings of block graphs and line graphs of trees | 2021-10-21 | Paper |
| Optimal Radio Labellings of Block Graphs and Line Graphs of Trees | 2021-08-29 | Paper |
| Optimal radio-\(k\)-labelings of trees | 2021-02-08 | Paper |
| Improved lower bounds for the radio number of trees | 2021-01-25 | Paper |
| Distance Graphs Generated by Five Primes (Research) | 2020-08-26 | Paper |
| Sequences of integers with three missing separations | 2020-02-20 | Paper |
| Colouring of generalized signed triangle-free planar graphs | 2019-01-22 | Paper |
| Upper bounds for the strong chromatic index of Halin graphs | 2018-01-10 | Paper |
| A combinatorial proof for the circular chromatic number of Kneser graphs | 2016-10-12 | Paper |
| Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$ | 2015-09-15 | Paper |
| List backbone colouring of graphs | 2014-03-27 | Paper |
| Backbone coloring for graphs with large girths | 2013-12-03 | Paper |
| Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) | 2013-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4897468 | 2012-12-19 | Paper |
| A short proof for Chen's alternative Kneser coloring lemma | 2012-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2918640 | 2012-10-08 | Paper |
| On-line list colouring of complete multipartite graphs | 2012-06-12 | Paper |
| On the strong chromatic index of cubic Halin graphs | 2012-05-18 | Paper |
| Strong edge-coloring for cubic Halin graphs | 2012-03-29 | Paper |
| Circular consecutive choosability of k-choosable graphs | 2011-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3073573 | 2011-02-11 | Paper |
| \(L(j,k)\)-labelling and maximum ordering-degrees for trees | 2010-05-05 | Paper |
| Multi-coloring the Mycielskian of graphs | 2010-04-22 | Paper |
| On \((d,1)\)-total numbers of graphs | 2009-12-09 | Paper |
| Coloring the Cartesian sum of graphs | 2009-01-28 | Paper |
| From rainbow to the lonely runner: A survey on coloring parameters of distances graphs | 2008-09-29 | Paper |
| Fractional chromatic number of distance graphs generated by two-interval sets | 2008-09-04 | Paper |
| Radio number for trees | 2008-02-11 | Paper |
| Coloring the Cartesian Sum of Graphs | 2007-05-29 | Paper |
| Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs | 2006-06-01 | Paper |
| Multilevel Distance Labelings for Paths and Cycles | 2006-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5466031 | 2005-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5463346 | 2005-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5461468 | 2005-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4677958 | 2005-05-23 | Paper |
| Fractional chromatic number and circular chromatic number for distance graphs with large clique size | 2005-02-16 | Paper |
| Circular chromatic number for iterated Mycielski graphs | 2004-08-19 | Paper |
| Asymptotic clique covering ratios of distance graphs | 2002-12-18 | Paper |
| Circular chromatic numbers of some reduced Kneser graphs | 2002-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552213 | 2002-08-29 | Paper |
| Hamiltonicity and circular distance two labellings | 2002-01-08 | Paper |
| Minimum Span of No-Hole (r+1)-Distant Colorings | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4949774 | 2001-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503967 | 2000-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940064 | 2000-03-01 | Paper |
| Distance graphs and \(T\)-coloring | 2000-01-30 | Paper |
| Star Extremal Circulant Graphs | 1999-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4238040 | 1999-06-23 | Paper |
| \(T\)-graphs and the channel assignment problem | 1997-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4863459 | 1996-02-06 | Paper |
| The channel assignment problem for mutually adjacent sites | 1995-07-13 | Paper |
| \(T\)-colorings of graphs | 1993-01-16 | Paper |
