| Publication | Date of Publication | Type |
|---|
| Weak degeneracy of planar graphs and locally planar graphs | 2024-02-16 | Paper |
| Weak (2, 3)-decomposition of planar graphs | 2024-02-16 | Paper |
| The Alon–Tarsi number of planar graphs revisited | 2024-01-30 | Paper |
| The circular chromatic number of signed series-parallel graphs of given girth | 2023-11-13 | Paper |
| Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2k+2 $2k+2$‐vertices | 2023-11-06 | Paper |
| Girth and λ $\lambda $‐choosability of graphs | 2023-10-12 | Paper |
| The strong fractional choice number of 3‐choice‐critical graphs | 2023-10-06 | Paper |
| Signed colouring and list colouring of k‐chromatic graphs | 2023-10-05 | Paper |
| Decomposing planar graphs into graphs with degree restrictions | 2023-10-05 | Paper |
| Chromatic λ‐choosable and λ‐paintable graphs | 2023-10-04 | Paper |
| 3‐Degenerate induced subgraph of a planar graph | 2023-10-04 | Paper |
| Multiple list coloring of 3‐choice critical graphs | 2023-08-22 | Paper |
| 2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs | 2023-08-21 | Paper |
| Refined List Version of Hadwiger’s Conjecture | 2023-08-11 | Paper |
| List 4-colouring of planar graphs | 2023-08-10 | Paper |
| Decomposition of planar graphs with forbidden configurations | 2023-03-29 | Paper |
| The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs | 2022-11-15 | Paper |
| Multiple DP-coloring of planar graphs without 3-cycles and normally adjacent 4-cycles | 2022-10-13 | Paper |
| Every nice graph is (1,5)-choosable | 2022-09-23 | Paper |
| Signed planar graphs with given circular chromatic numbers | 2022-08-24 | Paper |
| Dense Eulerian graphs are \((1, 3)\)-choosable | 2022-07-11 | Paper |
| Generalized signed graphs of large girth and large chromatic number | 2022-06-14 | Paper |
| The fractional chromatic number of generalized cones over graphs | 2022-05-12 | Paper |
| The circular chromatic numbers of signed series-parallel graphs | 2022-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5017348 | 2021-12-17 | Paper |
| Note on Hedetniemi's conjecture and the Poljak-Rödl function | 2021-12-10 | Paper |
| Generalized list colouring of graphs | 2021-11-30 | Paper |
| Total weight choosability for Halin graphs | 2021-09-06 | Paper |
| The slow-coloring game on sparse graphs: \(k\)-degenerate, planar, and outerplanar | 2021-07-23 | Paper |
| Circular chromatic number of signed graphs | 2021-06-21 | Paper |
| Choosability and paintability of the lexicographic product of graphs | 2021-06-07 | Paper |
| Every planar graph is 1-defective \((9,2)\)-paintable | 2021-03-17 | Paper |
| Colouring of \(S\)-labelled planar graphs | 2021-02-08 | Paper |
| Relatively small counterexamples to Hedetniemi's conjecture | 2021-02-03 | Paper |
| Clustering powers of sparse graphs | 2020-11-05 | Paper |
| The Alon-Tarsi number of a planar graph minus a matching | 2020-09-24 | Paper |
| A note about online nonrepetitive coloring \(k\)-trees | 2020-08-31 | Paper |
| On-line DP-coloring of graphs | 2020-08-31 | Paper |
| \(4\)-colouring of generalized signed planar graphs | 2020-08-25 | Paper |
| A note on the Poljak-Rödl function | 2020-07-29 | Paper |
| A connected version of the graph coloring game | 2020-06-29 | Paper |
| Fractional DP‐colorings of sparse graphs | 2020-05-21 | Paper |
| List coloring triangle‐free planar graphs | 2020-05-21 | Paper |
| The strong fractional choice number of series-parallel graphs | 2020-03-20 | Paper |
| The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\) | 2020-03-20 | Paper |
| A refinement of choosability of graphs | 2020-01-15 | Paper |
| A note on Hedetniemi's conjecture, Stahl's conjecture and the Poljak-Rödl function | 2019-12-09 | Paper |
| Chromatic number and orientations of graphs and signed graphs | 2019-08-06 | Paper |
| Multiple list colouring triangle free planar graphs | 2019-07-17 | Paper |
| Hamiltonian spectra of graphs | 2019-06-28 | Paper |
| Extremal problems on saturation for the family of $k$-edge-connected graphs | 2019-05-03 | Paper |
| Colouring of generalized signed triangle-free planar graphs | 2019-01-22 | Paper |
| Extensions of matroid covering and packing | 2018-12-20 | Paper |
| The Alon-Tarsi number of planar graphs | 2018-12-20 | Paper |
| Graphs are \((1, \varDelta + 1)\)-choosable | 2018-11-13 | Paper |
| Improved upper bound for generalized acyclic chromatic number of graphs | 2018-11-07 | Paper |
| Bounded greedy Nim | 2018-09-27 | Paper |
| Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable | 2018-08-15 | Paper |
| Total list weighting of graphs with bounded maximum average degree | 2018-08-15 | Paper |
| Defective 3-paintability of planar graphs | 2018-05-25 | Paper |
| Greedy Nim\(\mathrm{_k}\) game | 2018-05-24 | Paper |
| Completing orientations of partially oriented graphs | 2018-04-27 | Paper |
| Randomly twisted hypercubes | 2018-04-25 | Paper |
| List colouring of graphs and generalized Dyck paths | 2018-01-19 | Paper |
| The fault-diameter and wide-diameter of twisted hypercubes | 2017-12-06 | Paper |
| DP-colorings of graphs with high chromatic number | 2017-08-31 | Paper |
| A Hypercube Variant with Small Diameter | 2017-08-08 | Paper |
| On (4, 2)‐Choosable Graphs | 2017-07-05 | Paper |
| Total Weight Choosability of Trees | 2017-05-24 | Paper |
| Total weight choosability of graphs with bounded maximum average degree | 2017-05-22 | Paper |
| Every graph is \((2,3)\)-choosable | 2017-03-31 | Paper |
| Total weight choosability of Mycielski graphs | 2017-03-03 | Paper |
| Permanent index of matrices associated with graphs | 2017-02-17 | Paper |
| The wide-diameter of \(Z_{n, k}\) | 2017-01-23 | Paper |
| Circular chromatic Ramsey number | 2017-01-10 | Paper |
| Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\) | 2016-11-25 | Paper |
| Multiple list colouring of planar graphs | 2016-11-25 | Paper |
| Strong Chromatic Index of Sparse Graphs | 2016-11-17 | Paper |
| A combinatorial proof for the circular chromatic number of Kneser graphs | 2016-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2822601 | 2016-09-30 | Paper |
| Coloring, sparseness and girth | 2016-09-15 | Paper |
| Antimagic Labeling of Regular Graphs | 2016-08-12 | Paper |
| \((2+\epsilon )\)-nonrepetitive list colouring of paths | 2016-07-28 | Paper |
| Total weight choosability of cone graphs | 2016-06-09 | Paper |
| Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions | 2016-04-15 | Paper |
| Locally planar graphs are 2-defective 4-paintable | 2016-02-29 | Paper |
| Fractional Thue chromatic number of graphs | 2016-01-21 | Paper |
| Circular total chromatic numbers of graphs | 2015-12-08 | Paper |
| Regular Graphs of Odd Degree Are Antimagic | 2015-09-29 | Paper |
| The game Grundy indices of graphs | 2015-09-28 | Paper |
| Lower Bounds for On-line Graph Colorings | 2015-09-11 | Paper |
| Locally planar graphs are 5-paintable | 2015-06-01 | Paper |
| Characterization of \((2m,m)\)-paintable graphs | 2015-05-18 | Paper |
| Circular flow number of highly edge connected signed graphs | 2015-05-04 | Paper |
| Circular chromatic indices of even degree regular graphs | 2015-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5498276 | 2015-02-11 | Paper |
| Maximum 4-degenerate subgraph of a planar graph | 2015-01-22 | Paper |
| Nonrepetitive colorings of lexicographic product of graphs | 2014-11-10 | Paper |
| Colouring edges with many colours in cycles | 2014-10-22 | Paper |
| Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices | 2014-10-08 | Paper |
| Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs | 2014-09-04 | Paper |
| Anti-magic labeling of trees | 2014-08-08 | Paper |
| Circular Chromatic Indices of Regular Graphs | 2014-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419975 | 2014-06-11 | Paper |
| List backbone colouring of graphs | 2014-03-27 | Paper |
| Towards an on-line version of Ohba's conjecture | 2014-03-25 | Paper |
| Erratum to ``Application of polynomial method to on-line list colouring of graphs | 2014-02-10 | Paper |
| Antimagic Labeling of Cubic Graphs | 2014-01-28 | Paper |
| Backbone coloring for graphs with large girths | 2013-12-03 | Paper |
| Partial Online List Coloring of Graphs | 2013-11-15 | Paper |
| Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree | 2013-11-15 | Paper |
| The game Grundy number of graphs | 2013-06-13 | Paper |
| Anti-magic labelling of Cartesian product of graphs | 2013-04-17 | Paper |
| A short proof for Chen's alternative Kneser coloring lemma | 2012-11-09 | Paper |
| Total weight choosability of Cartesian product of graphs | 2012-09-12 | Paper |
| Antimagic labelling of vertex weighted graphs | 2012-07-10 | Paper |
| Weighted-1-antimagic graphs of prime power order | 2012-07-04 | Paper |
| On-line list colouring of complete multipartite graphs | 2012-06-12 | Paper |
| On-line 3-choosable planar graphs | 2012-06-04 | Paper |
| Adapted game colouring of graphs | 2012-05-04 | Paper |
| Application of polynomial method to on-line list colouring of graphs | 2012-05-04 | Paper |
| Thue choosability of trees | 2012-04-30 | Paper |
| Decomposition of sparse graphs into two forests, one having bounded maximum degree | 2012-03-27 | Paper |
| Decomposing a graph into forests | 2012-03-19 | Paper |
| The surviving rate of planar graphs | 2012-03-13 | Paper |
| Graphs with chromatic numbers strictly less than their colouring numbers | 2012-03-07 | Paper |
| Distinguishing labeling of the actions of almost simple groups. | 2012-02-13 | Paper |
| Complexity of Cycle Transverse Matching Problems | 2012-01-13 | Paper |
| Short cycle covers of graphs and nowhere-zero flows | 2011-12-20 | Paper |
| Circular flow on signed graphs | 2011-12-08 | Paper |
| Entire colouring of plane graphs | 2011-12-08 | Paper |
| Cycle adjacency of planar graphs and 3-colourability | 2011-12-01 | Paper |
| The fractional version of Hedetniemi's conjecture is true | 2011-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3171325 | 2011-10-05 | Paper |
| Circular consecutive choosability of k-choosable graphs | 2011-07-21 | Paper |
| Multiple Coloring of Cone Graphs | 2011-07-18 | Paper |
| Total weight choosability of graphs | 2011-03-21 | Paper |
| The surviving rate of an outerplanar graph for the firefighter problem | 2011-02-21 | Paper |
| Nonrepetitive list colourings of paths | 2011-01-17 | Paper |
| Acyclic 4-choosability of planar graphs | 2011-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3060867 | 2010-12-13 | Paper |
| The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three | 2010-12-03 | Paper |
| Claw‐free circular‐perfect graphs | 2010-11-10 | Paper |
| Choosability of toroidal graphs without short cycles | 2010-11-10 | Paper |
| Total coloring of planar graphs of maximum degree eight | 2010-09-07 | Paper |
| The Two-Coloring Number and Degenerate Colorings of Planar Graphs | 2010-08-27 | Paper |
| Rainbow domination on trees | 2010-05-05 | Paper |
| Decomposition of sparse graphs, with application to game coloring number | 2010-05-05 | Paper |
| Multi-coloring the Mycielskian of graphs | 2010-04-22 | Paper |
| On-line list colouring of graphs | 2010-03-26 | Paper |
| Game colouring directed graphs | 2010-03-26 | Paper |
| Adapted list coloring of planar graphs | 2009-12-18 | Paper |
| Adaptable chromatic number of graph products | 2009-12-15 | Paper |
| Colouring graphs with bounded generalized colouring number | 2009-12-15 | Paper |
| Adaptable choosability of planar graphs with sparse short cycles | 2009-12-15 | Paper |
| Circular game chromatic number of graphs | 2009-12-10 | Paper |
| Game colouring of the square of graphs | 2009-12-10 | Paper |
| Bipartite density of triangle-free subcubic graphs | 2009-06-30 | Paper |
| Colouring games on outerplanar graphs and trees | 2009-06-23 | Paper |
| Distinguishing labeling of group actions | 2009-06-17 | Paper |
| Circular degree choosability | 2009-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3615804 | 2009-03-24 | Paper |
| Adapted List Coloring of Graphs and Hypergraphs | 2009-03-16 | Paper |
| An upper bound on adaptable choosability of graphs | 2009-03-04 | Paper |
| Circular choosability via combinatorial Nullstellensatz | 2009-02-20 | Paper |
| Game coloring the Cartesian product of graphs | 2009-02-20 | Paper |
| Coloring the Cartesian sum of graphs | 2009-01-28 | Paper |
| The 6-relaxed game chromatic number of outerplanar graphs | 2009-01-28 | Paper |
| Bipartite subgraphs of triangle-free subcubic graphs | 2009-01-21 | Paper |
| Circular chromatic index of Cartesian products of graphs | 2008-11-19 | Paper |
| Circular consecutive choosability of graphs | 2008-09-29 | Paper |
| Fractional chromatic number of distance graphs generated by two-interval sets | 2008-09-04 | Paper |
| Claw-free circular-perfect graphs | 2008-06-05 | Paper |
| Activation strategy for asymmetric marking games | 2008-05-29 | Paper |
| Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs | 2008-05-13 | Paper |
| On the adaptable chromatic number of graphs | 2008-05-13 | Paper |
| Minimal circular-imperfect graphs of large clique number and large independence number | 2008-05-13 | Paper |
| The Map-Coloring Game | 2008-03-20 | Paper |
| Refined activation strategy for the marking game | 2007-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5310233 | 2007-09-21 | Paper |
| List circular coloring of trees and cycles | 2007-07-30 | Paper |
| Coloring the Cartesian Sum of Graphs | 2007-05-29 | Paper |
| Three classes of minimal circular-imperfect graphs | 2007-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3424895 | 2007-03-05 | Paper |
| The circular chromatic index of graphs of high girth | 2007-01-11 | Paper |
| Cartesian powers of graphs can be distinguished by two labels | 2006-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3412129 | 2006-12-05 | Paper |
| Distinguishing labellings of group action on vector spaces and graphs | 2006-10-19 | Paper |
| On the circular chromatic number of circular partitionable graphs | 2006-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5480727 | 2006-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5480765 | 2006-08-03 | 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 |
| Circular chromatic index of graphs of maximum degree 3 | 2005-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5466031 | 2005-08-23 | Paper |
| Coloring-flow duality of embedded graphs | 2005-07-26 | Paper |
| Graphs of large girth with prescribed partial circular colourings | 2005-05-12 | Paper |
| Circular perfect graphs | 2005-04-21 | Paper |
| Circular choosability of graphs | 2005-04-21 | Paper |
| Resource-sharing system scheduling and circular chromatic number | 2005-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660729 | 2005-04-04 | Paper |
| Fractional chromatic number and circular chromatic number for distance graphs with large clique size | 2005-02-16 | Paper |
| Sparse \(H\)-colourable graphs of bounded maximum degree | 2004-12-13 | Paper |
| The circular chromatic number of induced subgraphs | 2004-10-01 | Paper |
| Density of the circular chromatic numbers of series-parallel graphs | 2004-08-06 | Paper |
| Relaxed game chromatic number of trees and outerplanar graphs | 2004-08-06 | Paper |
| Incidence coloring of \(k\)-degenerated graphs | 2004-08-06 | Paper |
| On sparse graphs with given colorings and homomorphisms. | 2004-03-15 | Paper |
| 4-colorable 6-regular toroidal graphs. | 2004-01-05 | Paper |
| Circular chromatic number of subgraphs | 2003-10-29 | Paper |
| Circular chromatic number and Mycielski construction | 2003-10-29 | Paper |
| An analogue of Hajós' theorem for the circular chromatic number. II | 2003-10-16 | Paper |
| Construction of graphs with given circular flow numbers | 2003-08-20 | Paper |
| Coloring the square of a \(K_{4}\)-minor free graph | 2003-08-19 | Paper |
| Circular chromatic number of Kneser graphs | 2003-08-17 | Paper |
| Circular chromatic numbers of a class of distance graphs | 2003-05-25 | Paper |
| Relaxed game chromatic number of graphs | 2003-04-28 | Paper |
| Construction of \(K_{n}\)-minor free graphs with given circular chromatic number | 2003-04-09 | Paper |
| Circular chromatic number of distance graphs with distance sets of cardinality 3 | 2003-03-19 | Paper |
| Edge-partitions of planar graphs and their game coloring numbers | 2003-03-19 | Paper |
| Asymptotic clique covering ratios of distance graphs | 2002-12-18 | Paper |
| Circular colouring and orientation of graphs | 2002-12-10 | Paper |
| The fractional chromatic number of the direct product of graphs | 2002-10-09 | Paper |
| On Hedetniemi's conjecture and the colour template scheme | 2002-08-29 | Paper |
| Tight relation between the circular chromatic number and the girth of series-parallel graphs | 2002-08-29 | Paper |
| The level of nonmultiplicativity of graphs | 2002-05-21 | Paper |
| The circular chromatic number of series-parallel graphs of large odd girth | 2002-05-15 | Paper |
| Construction of sparse graphs with prescribed circular colorings | 2002-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712591 | 2001-08-12 | Paper |
| Circular chromatic number of planar graphs of large odd girth | 2001-07-09 | Paper |
| Circular chromatic number: A survey | 2001-07-05 | Paper |
| An analogue of Hajós’ Theorem for the circular chromatic number | 2001-07-05 | Paper |
| Circular chromatic number and graph minors | 2001-03-28 | Paper |
| The game coloring number of pseudo partial \(k\)-trees | 2000-11-12 | Paper |
| Chromatic Ramsey numbers | 2000-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944681 | 2000-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4948748 | 2000-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503967 | 2000-09-14 | Paper |
| Pseudo-Hamiltonian-connected graphs | 2000-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4256101 | 2000-06-07 | Paper |
| The game coloring number of planar graphs | 2000-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940056 | 2000-03-01 | Paper |
| Distance graphs and \(T\)-coloring | 2000-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4256103 | 2000-01-25 | Paper |
| A bound for the game chromatic number of graphs | 2000-01-19 | Paper |
| Planar graphs with circular chromatic numbers between 3 and 4 | 1999-12-20 | Paper |
| Graphs whose circular chromatic number equals the chromatic number | 1999-12-08 | Paper |
| Star Extremal Circulant Graphs | 1999-11-23 | Paper |
| Circular colouring and graph homomorphism | 1999-10-28 | Paper |
| Minimal oriented graphs of diameter 2 | 1999-08-02 | Paper |
| Relaxed coloring of a graph | 1999-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4238040 | 1999-06-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4242914 | 1999-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4221701 | 1999-03-17 | Paper |
| A survey on Hedetniemi's conjecture | 1999-02-14 | Paper |
| Multiplicativity of acyclic local tournaments | 1999-01-24 | Paper |
| Circular chromatic numbers of Mycielski's graphs | 1999-01-01 | Paper |
| Circular chromatic numbers and fractional chromatic numbers of distance graphs | 1998-09-16 | Paper |
| Pattern periodic coloring of distance graphs | 1998-08-10 | Paper |
| The chromatic numbers of distance graphs | 1998-01-12 | Paper |
| Duality and Polynomial Testing of Tree Homomorphisms | 1997-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3129826 | 1997-10-20 | Paper |
| Complexity of tree homomorphisms | 1997-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4892340 | 1997-06-22 | Paper |
| Path homomorphisms | 1997-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5284584 | 1997-01-22 | Paper |
| Star chromatic numbers of graphs | 1996-12-16 | Paper |
| Star-extremal graphs and the lexicographic product | 1996-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4894618 | 1996-10-07 | Paper |
| On the bounds for the ultimate independence ratio of a graph | 1996-10-07 | Paper |
| Ramsey families which exclude a graph | 1996-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4878664 | 1996-06-24 | Paper |
| On homomorphisms to acyclic local tournaments | 1996-05-13 | Paper |
| A Polynomial Algorithm for Homomorphisms to Oriented Cycles | 1996-04-11 | Paper |
| The Existence of Homomorphisms to Oriented Cycles | 1996-02-12 | Paper |
| Homomorphisms to oriented paths | 1995-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4320685 | 1995-02-02 | Paper |
| Mutiplicativity of oriented cycles | 1995-01-02 | Paper |
| Homomorphisms to oriented cycles | 1994-04-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3137213 | 1993-11-07 | Paper |
| Inexhaustible homogeneous structures | 1993-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4033013 | 1993-05-18 | Paper |
| An approach to hedetniemi's conjecture | 1993-01-17 | Paper |
| Multiplicative posets | 1993-01-16 | Paper |
| Star chromatic numbers and products of graphs | 1992-12-17 | Paper |
| A simple proof of the multiplicativity of directed cycles of prime power length | 1992-09-27 | Paper |
| An approach on fixed pansystems theorems: panchaos and strange panattractor | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3734412 | 1984-01-01 | Paper |
