| Publication | Date of Publication | Type |
|---|
| Obituary: Gert Sabidussi 1929--2022 | 2024-10-22 | Paper |
| On cop-win dynamic graphs | 2024-08-09 | Paper |
| Edge clique covers in graphs with independence number two | 2023-09-29 | Paper |
| Siblings of countable cographs | 2020-04-26 | Paper |
| A lower bound on the size of an absorbing set in an arc-coloured tournament | 2018-11-13 | Paper |
| A note on the circuit double cover of infinite graphs | 2017-07-25 | Paper |
| Cops and robbers ordinals of cop-win trees | 2017-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5298910 | 2013-06-25 | Paper |
| Gathering information in a graph | 2013-06-25 | Paper |
| Some results on the injective chromatic number of graphs | 2013-01-03 | Paper |
| Lexicographic products with high reconstruction numbers | 2012-05-30 | Paper |
| Large classes of infinite \(k\)-cop-win graphs | 2010-12-14 | Paper |
| The cop density of a graph | 2010-05-05 | Paper |
| Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete | 2010-04-28 | Paper |
| Some bounds on the injective chromatic number of graphs | 2010-03-29 | Paper |
| The capture time of a graph | 2009-12-15 | Paper |
| Intervals of Sabidussi graphs | 2009-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5445040 | 2008-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3410577 | 2006-11-27 | Paper |
| A note on \(k\)-cop, \(l\)-robber games on graphs | 2006-10-30 | Paper |
| Absorbing sets in arc-coloured tournaments | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4457550 | 2004-03-25 | Paper |
| On cop-win graphs | 2002-12-02 | Paper |
| On the injective chromatic number of graphs | 2002-12-02 | Paper |
| Cycle regular graphs need not be transitive | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4489145 | 2000-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4352272 | 1998-01-19 | Paper |
| Edge-ends in countable graphs | 1997-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4881843 | 1996-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4848762 | 1996-02-20 | Paper |
| Minimal graphs that fold onto \(K_ n\) | 1996-02-08 | Paper |
| On the ultimate independence ratio of a graph | 1996-01-07 | Paper |
| On a matrix partition conjecture | 1995-04-05 | Paper |
| Infinite friendship graphs with infinite parameters | 1991-01-01 | Paper |
| A note concerning paths and independence number in digraphs | 1990-01-01 | Paper |
| Path and cycle sub-Ramsey numbers and an edge-colouring conjecture | 1986-01-01 | Paper |
| Concerning the achromatic number of graphs | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3739151 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3216676 | 1985-01-01 | Paper |
| Infinite generalized friendship graphs | 1984-01-01 | Paper |
| More star sub-Ramsey numbers | 1981-01-01 | Paper |
| The automorphism group of a product of hypergraphs | 1981-01-01 | Paper |
| The automorphism group of the wreath product of directed graphs | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3852207 | 1977-01-01 | Paper |
