| Publication | Date of Publication | Type |
|---|
| Comparison of sum choice number with chromatic sum | 2021-06-14 | Paper |
| A note on complex-4-colorability of signed planar graphs | 2021-05-11 | Paper |
| Generalized sum List colorings of graphs | 2019-05-27 | Paper |
| Zig-zag facial total-coloring of plane graphs | 2018-12-10 | Paper |
| A note on not-4-list colorable planar graphs | 2018-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636175 | 2018-04-23 | Paper |
| Bounds for the sum choice number | 2018-04-10 | Paper |
| Sum choice number of generalized \(\theta\)-graphs | 2017-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2971199 | 2017-04-04 | Paper |
| List-colourings | 2016-09-30 | Paper |
| Sum list edge colorings of graphs | 2016-07-13 | Paper |
| Facial list colourings of plane graphs | 2016-07-05 | Paper |
| Sum list colorings of products of graphs | 2016-04-13 | Paper |
| A note on adjacent vertex distinguishing colorings of graphs | 2016-04-07 | Paper |
| Sum list colorings of wheels | 2015-12-17 | Paper |
| \((\mathcal{P},\mathcal{Q})\)-total \((r,s)\)-colorings of graphs | 2015-06-01 | Paper |
| Orientations of graphs with prescribed weighted out-degrees | 2015-01-20 | Paper |
| Fractional \((\mathcal P, \mathcal Q)\)-total list colorings of graphs | 2013-12-13 | Paper |
| List colorings of \(K_5\)-minor-free graphs with special list assignments | 2012-09-12 | Paper |
| Weights of induced subgraphs in \(K_{1,r}\)-free graphs | 2012-08-10 | Paper |
| Parity vertex colouring of plane graphs | 2011-02-18 | Paper |
| Precoloring extension for 2-connected graphs with maximum degree three | 2009-12-15 | Paper |
| On list critical graphs | 2009-12-15 | Paper |
| Precoloring extension forK4-minor-free graphs | 2009-06-16 | Paper |
| Precoloring Extension for 2‐connected Graphs | 2008-03-28 | Paper |
| Characterization of graphs dominated by induced paths | 2007-03-02 | Paper |
| List colourings of planar graphs. (Reprint) | 2006-08-04 | Paper |
| List version of \(L(d,s)\)-labelings | 2006-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414507 | 2003-07-25 | Paper |
| Distance graphs with finite chromatic number | 2002-12-10 | Paper |
| A note on planar 5-list colouring: Non-extendability at distance 4 | 2002-08-29 | Paper |
| Oriented list colorings of graphs | 2002-08-28 | Paper |
| Polyhedral graphs with restricted number of faces of the same type | 2002-05-21 | Paper |
| Colouring of distance graphs | 2001-12-17 | Paper |
| On weights of induced paths and cycles in claw-free and \(K_{1,r}\)-free graphs | 2001-07-08 | Paper |
| On Dominating Sets and Independent Sets of Graphs | 2001-04-20 | Paper |
| Algorithmic aspects of partial list colourings | 2001-04-20 | Paper |
| Remarks on the existence of uniquely partitionable planar graphs | 2001-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518396 | 2000-11-28 | Paper |
| On uniquely partitionable planar graphs | 2000-11-02 | Paper |
| Complexity of choosing subsets from color sets | 2000-11-02 | Paper |
| On-line rankings of graphs | 2000-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263476 | 2000-01-03 | Paper |
| Brooks-type theorems for choosability with separation | 1998-09-07 | Paper |
| List colorings and reducibility | 1998-01-28 | Paper |
| Choosability and fractional chromatic numbers | 1997-12-02 | Paper |
| Minimal colorings for properly colored subgraphs | 1997-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4888118 | 1996-12-09 | Paper |
| Choosability of planar graphs | 1996-11-25 | Paper |
| A not 3-choosable planar graph without 3-cycles | 1996-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4882474 | 1996-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4882475 | 1996-06-16 | Paper |
| Chromatic number of prime distance graphs | 1995-03-09 | Paper |
| List colourings of planar graphs | 1994-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4285228 | 1994-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4005786 | 1992-09-27 | Paper |
| On the chromatic number of special distance graphs | 1992-06-28 | Paper |
