| Publication | Date of Publication | Type |
|---|
| On the split reliability of graphs | 2023-12-18 | Paper |
| Roots of two‐terminal reliability polynomials | 2023-12-11 | Paper |
| Network reliability: Heading out on the highway | 2023-12-11 | Paper |
| Rational roots of all‐terminal reliability | 2023-11-23 | Paper |
| Network reliability | 2023-04-28 | Paper |
| On the unimodality of domination polynomials | 2022-06-10 | Paper |
| Acyclic polynomials of graphs | 2022-05-31 | Paper |
| On the Real Roots of Domination Polynomials | 2022-03-28 | Paper |
| The average order of dominating sets of a graph | 2021-09-30 | Paper |
| Optimal domination polynomials | 2021-02-16 | Paper |
| A note on purely imaginary independence roots | 2020-10-08 | Paper |
| On the roots of the subtree polynomial | 2020-09-15 | Paper |
| The Average Order of Dominating Sets of a Graph | 2020-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3295614 | 2020-07-10 | Paper |
| On the imaginary parts of chromatic roots | 2020-05-21 | Paper |
| Maximum modulus of independence roots of graphs and trees | 2020-04-30 | Paper |
| Independence Equivalence Classes of Paths and Cycles | 2019-12-19 | Paper |
| On the reliability roots of simplicial complexes and matroids | 2019-08-20 | Paper |
| All Terminal Reliability Roots of Smallest Modulus | 2019-06-05 | Paper |
| The Domination Equivalence Classes of Paths | 2019-05-23 | Paper |
| Optimal graphs for independence and \(k\)-independence polynomials | 2019-01-11 | Paper |
| Restraints permitting the largest number of colourings | 2018-09-25 | Paper |
| On the roots of Wiener polynomials of graphs | 2018-07-26 | Paper |
| On the stability of independence polynomials | 2018-05-25 | Paper |
| Inflection points of reliability polynomials are dense in [0,1] | 2018-05-23 | Paper |
| On the roots of the node reliability polynomial | 2018-05-11 | Paper |
| Nonexistence of optimal graphs for all terminal reliability | 2018-05-11 | Paper |
| On the unimodality of independence polynomials of very well-covered graphs | 2018-02-23 | Paper |
| The shape of node reliability | 2018-02-22 | Paper |
| On the roots of all-terminal reliability polynomials | 2017-08-29 | Paper |
| On the domination polynomials of friendship graphs | 2017-07-19 | Paper |
| A note on the real part of complex chromatic roots | 2016-11-30 | Paper |
| On the real roots of \(\sigma\)-polynomials | 2016-11-29 | Paper |
| On the Roots of σ-Polynomials | 2016-06-10 | Paper |
| Extremal Restraints for Graph Colourings | 2015-08-05 | Paper |
| New bounds for chromatic polynomials and chromatic roots | 2015-06-29 | Paper |
| On the spectrum and number of convex sets in graphs | 2015-04-01 | Paper |
| Graphs with a minimal number of convex sets | 2015-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2929612 | 2014-11-13 | Paper |
| The average reliability of a graph | 2014-09-08 | Paper |
| Independence densities of hypergraphs | 2014-08-28 | Paper |
| On the roots of domination polynomials | 2014-06-16 | Paper |
| A note on the real part of complex chromatic roots | 2014-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5409968 | 2014-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2843434 | 2013-08-22 | Paper |
| On the Roots of Expected Independence Polynomials | 2013-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4924918 | 2013-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4909710 | 2013-03-21 | Paper |
| On a sequence of sparse binomial-type polynomials | 2012-12-04 | Paper |
| Asymptotics of a sequence of sparse binomial-type polynomials | 2012-11-16 | Paper |
| Independence and chromatic densities of graphs | 2012-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2891252 | 2012-06-13 | Paper |
| Parity Party with Picture Proofs: An Odd Checkerboard Problem | 2011-12-07 | Paper |
| Well-covered circulant graphs | 2011-02-18 | Paper |
| On the roots of strongly connected reliability polynomials | 2010-11-24 | Paper |
| Proof of a conjecture on fractional Ramsey numbers | 2010-04-22 | Paper |
| The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane | 2009-12-15 | Paper |
| Monomial bases for broken circuit complexes | 2009-12-03 | Paper |
| Chip firing and all-terminal network reliability bounds | 2009-11-23 | Paper |
| Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers | 2009-06-19 | Paper |
| Independence polynomials of circulants with an application to music | 2009-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3624967 | 2009-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5503343 | 2009-01-15 | Paper |
| The structure of well-covered graphs with no cycles of length 4 | 2007-08-23 | Paper |
| Uniformly optimal digraphs for strongly connected reliability | 2007-03-30 | Paper |
| The well-covered dimension of random graphs | 2007-02-13 | Paper |
| Well-Covered Vector Spaces of Graphs | 2006-06-01 | Paper |
| Bounding the roots of ideal and open set polynomials | 2005-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5461524 | 2005-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2716005 | 2005-07-20 | Paper |
| The strongly connected reliability of complete digraphs | 2005-06-01 | Paper |
| Average independence polynomials | 2005-03-08 | Paper |
| The \(k\)-fractal of a simplicial complex | 2004-08-19 | Paper |
| On the location of roots of independence polynomials | 2004-08-10 | Paper |
| The independence fractal of a graph. | 2003-08-25 | Paper |
| On the chromatic roots of generalized theta graphs | 2002-12-10 | Paper |
| On chromatic roots of large subdivisions of graphs | 2002-10-24 | Paper |
| Roots of independence polynomials of well covered graphs | 2002-10-10 | Paper |
| Chromatic polynomials and order ideals of monomials | 2000-11-02 | Paper |
| Subdivisions and chromatic roots | 1999-12-20 | Paper |
| On the roots of chromatic polynomials | 1999-07-05 | Paper |
| The existence of uniquely \(-G\) colourable graphs | 1998-03-24 | Paper |
| Cohen–Macaulay Rings in Network Reliability | 1997-03-11 | Paper |
| The number of complements of a topology on \(n\) points is at least \(2^ n\) (except for some special cases) | 1996-11-25 | Paper |
| The complexity of generalized graph colorings | 1996-10-09 | Paper |
| The Ultimate Categorical Independence Ratio of a Graph | 1996-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873670 | 1996-04-17 | Paper |
| Non-Stanley bounds for network reliability | 1996-03-17 | Paper |
| Partial order complementation graphs | 1995-06-13 | Paper |
| The inducibility of complete bipartite graphs | 1995-04-09 | Paper |
| On the log concavity of reliability and matroidal sequences | 1994-07-03 | Paper |
| Mutually complementary partial orders | 1993-06-29 | Paper |
| Network transformations and bounding network reliability | 1993-06-29 | Paper |
| ON UNIQUELY -G k-COLOURABLE GRAPHS | 1993-05-16 | Paper |
| Roots of the Reliability Polynomials | 1993-04-01 | Paper |
| A vertex critical graph without critical edges | 1992-09-27 | Paper |
| Graph properties and hypergraph colourings | 1992-06-28 | Paper |
| Self complementary topologies and preorders | 1992-06-26 | Paper |
| A Ramsey type problem concerning vertex colourings | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3351379 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3356319 | 1990-01-01 | Paper |
| A note onKi-perfect graphs | 1990-01-01 | Paper |
| A Construction of Uniquely C4-free colourable Graphs | 1990-01-01 | Paper |
| A Set System Polynomial with Colouring and Reliability Applications | 1988-01-01 | Paper |
| On generalized graph colorings | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789615 | 1987-01-01 | Paper |
