| Publication | Date of Publication | Type |
|---|
New approximations for network reliability
Networks | 2024-07-03 | Paper |
On the split reliability of graphs
Networks | 2023-12-18 | Paper |
Roots of two‐terminal reliability polynomials
Networks | 2023-12-11 | Paper |
Network reliability: Heading out on the highway
Networks | 2023-12-11 | Paper |
Rational roots of all‐terminal reliability
Networks | 2023-11-23 | Paper |
Network reliability
Handbook of the Tutte Polynomial and Related Topics | 2023-04-28 | Paper |
On the unimodality of domination polynomials
Graphs and Combinatorics | 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
Discrete Mathematics | 2021-09-30 | Paper |
Optimal domination polynomials
Graphs and Combinatorics | 2021-02-16 | Paper |
A note on purely imaginary independence roots
Discrete Mathematics | 2020-10-08 | Paper |
On the roots of the subtree polynomial
European Journal of Combinatorics | 2020-09-15 | Paper |
The Average Order of Dominating Sets of a Graph
| 2020-08-14 | Paper |
A note on polynomial profiles of placement games
| 2020-07-10 | Paper |
On the imaginary parts of chromatic roots
Journal of Graph Theory | 2020-05-21 | Paper |
Maximum modulus of independence roots of graphs and trees
Graphs and Combinatorics | 2020-04-30 | Paper |
Independence equivalence classes of paths and cycles
| 2019-12-19 | Paper |
On the reliability roots of simplicial complexes and matroids
Discrete Mathematics | 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
Graphs and Combinatorics | 2019-01-11 | Paper |
Restraints permitting the largest number of colourings
Discrete Applied Mathematics | 2018-09-25 | Paper |
On the roots of Wiener polynomials of graphs
Discrete Mathematics | 2018-07-26 | Paper |
On the stability of independence polynomials
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
Inflection points of reliability polynomials are dense in \([0,1\)]
Networks | 2018-05-23 | Paper |
On the roots of the node reliability polynomial
Networks | 2018-05-11 | Paper |
Nonexistence of optimal graphs for all terminal reliability
Networks | 2018-05-11 | Paper |
On the unimodality of independence polynomials of very well-covered graphs
Discrete Mathematics | 2018-02-23 | Paper |
The shape of node reliability
Discrete Applied Mathematics | 2018-02-22 | Paper |
On the roots of all-terminal reliability polynomials
Discrete Mathematics | 2017-08-29 | Paper |
On the domination polynomials of friendship graphs
Filomat | 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
Graphs and Combinatorics | 2016-11-29 | Paper |
On the roots of \(\sigma\)-polynomials
Journal of Graph Theory | 2016-06-10 | Paper |
Extremal restraints for graph colourings
| 2015-08-05 | Paper |
New bounds for chromatic polynomials and chromatic roots
Discrete Mathematics | 2015-06-29 | Paper |
On the spectrum and number of convex sets in graphs
Discrete Mathematics | 2015-04-01 | Paper |
Graphs with a minimal number of convex sets
Graphs and Combinatorics | 2015-01-20 | Paper |
Mathematics for the liberal arts
| 2014-11-13 | Paper |
The average reliability of a graph
Discrete Applied Mathematics | 2014-09-08 | Paper |
Independence densities of hypergraphs
European Journal of Combinatorics | 2014-08-28 | Paper |
On the roots of domination polynomials
Graphs and Combinatorics | 2014-06-16 | Paper |
A note on the real part of complex chromatic roots
Discrete Mathematics | 2014-05-06 | Paper |
Our days are numbered. How mathematics orders our lives
| 2014-04-15 | Paper |
Discrete structures and their interactions
Discrete Mathematics and its Applications | 2013-08-22 | Paper |
On the roots of expected independence polynomials
Journal of Graph Theory | 2013-07-31 | Paper |
Line graphs and circulants
| 2013-06-10 | Paper |
On circulants uniquely characterized by their independence polynomials.
| 2013-03-21 | Paper |
On a sequence of sparse binomial-type polynomials
Journal of Mathematical Analysis and Applications | 2012-12-04 | Paper |
Asymptotics of a sequence of sparse binomial-type polynomials
Analysis | 2012-11-16 | Paper |
Independence and chromatic densities of graphs
Journal of Combinatorics | 2012-08-28 | Paper |
Series representations of theta functions in terms of a sequence of polynomials
The Fibonacci Quarterly | 2012-06-13 | Paper |
Parity party with picture proofs: an odd checkerboard problem
Mathematics Magazine | 2011-12-07 | Paper |
Well-covered circulant graphs
Discrete Mathematics | 2011-02-18 | Paper |
On the roots of strongly connected reliability polynomials
Networks | 2010-11-24 | Paper |
Proof of a conjecture on fractional Ramsey numbers
Journal of Graph Theory | 2010-04-22 | Paper |
The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane
Discrete Mathematics | 2009-12-15 | Paper |
Monomial bases for broken circuit complexes
European Journal of Combinatorics | 2009-12-03 | Paper |
Chip firing and all-terminal network reliability bounds
Discrete Optimization | 2009-11-23 | Paper |
Independence polynomials of circulants with an application to music
Discrete Mathematics | 2009-06-19 | Paper |
Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers
Discrete Mathematics | 2009-06-19 | Paper |
The Ehrenfeucht-Fraïssé game for paths and cycles.
| 2009-05-06 | Paper |
The neighbourhood polynomial of a graph
| 2009-01-15 | Paper |
The structure of well-covered graphs with no cycles of length 4
Discrete Mathematics | 2007-08-23 | Paper |
Uniformly optimal digraphs for strongly connected reliability
Networks | 2007-03-30 | Paper |
The well-covered dimension of random graphs
Discrete Mathematics | 2007-02-13 | Paper |
Well-Covered Vector Spaces of Graphs
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Bounding the roots of ideal and open set polynomials
Annals of Combinatorics | 2005-11-02 | Paper |
scientific article; zbMATH DE number 2188422 (Why is no real title available?)
| 2005-07-26 | Paper |
Bounding the roots of independence polynomials.
Ars Combinatoria | 2005-07-20 | Paper |
The strongly connected reliability of complete digraphs
Networks | 2005-06-01 | Paper |
Average independence polynomials
Journal of Combinatorial Theory. Series B | 2005-03-08 | Paper |
The \(k\)-fractal of a simplicial complex
Discrete Mathematics | 2004-08-19 | Paper |
On the location of roots of independence polynomials
Journal of Algebraic Combinatorics | 2004-08-10 | Paper |
The independence fractal of a graph.
Journal of Combinatorial Theory. Series B | 2003-08-25 | Paper |
On the chromatic roots of generalized theta graphs
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
On chromatic roots of large subdivisions of graphs
Discrete Mathematics | 2002-10-24 | Paper |
Roots of independence polynomials of well covered graphs
Journal of Algebraic Combinatorics | 2002-10-10 | Paper |
Chromatic polynomials and order ideals of monomials
Discrete Mathematics | 2000-11-02 | Paper |
Subdivisions and chromatic roots
Journal of Combinatorial Theory. Series B | 1999-12-20 | Paper |
On the roots of chromatic polynomials
Journal of Combinatorial Theory. Series B | 1999-07-05 | Paper |
The existence of uniquely \(-G\) colourable graphs
Discrete Mathematics | 1998-03-24 | Paper |
Cohen–Macaulay Rings in Network Reliability
SIAM Journal on Discrete Mathematics | 1997-03-11 | Paper |
The number of complements of a topology on \(n\) points is at least \(2^ n\) (except for some special cases)
Discrete Mathematics | 1996-11-25 | Paper |
The complexity of generalized graph colorings
Discrete Applied Mathematics | 1996-10-09 | Paper |
The Ultimate Categorical Independence Ratio of a Graph
SIAM Journal on Discrete Mathematics | 1996-10-06 | Paper |
scientific article; zbMATH DE number 866651 (Why is no real title available?)
| 1996-04-17 | Paper |
Non-Stanley bounds for network reliability
Journal of Algebraic Combinatorics | 1996-03-17 | Paper |
Partial order complementation graphs
Order | 1995-06-13 | Paper |
The inducibility of complete bipartite graphs
Journal of Graph Theory | 1995-04-09 | Paper |
On the log concavity of reliability and matroidal sequences
Advances in Applied Mathematics | 1994-07-03 | Paper |
Network transformations and bounding network reliability
Networks | 1993-06-29 | Paper |
Mutually complementary partial orders
Discrete Mathematics | 1993-06-29 | Paper |
ON UNIQUELY -G k-COLOURABLE GRAPHS
Quaestiones Mathematicae | 1993-05-16 | Paper |
Roots of the Reliability Polynomials
SIAM Journal on Discrete Mathematics | 1993-04-01 | Paper |
A vertex critical graph without critical edges
Discrete Mathematics | 1992-09-27 | Paper |
Graph properties and hypergraph colourings
Discrete Mathematics | 1992-06-28 | Paper |
Self complementary topologies and preorders
Order | 1992-06-26 | Paper |
A Ramsey type problem concerning vertex colourings
Journal of Combinatorial Theory. Series B | 1991-01-01 | Paper |
scientific article; zbMATH DE number 4202279 (Why is no real title available?)
| 1990-01-01 | Paper |
scientific article; zbMATH DE number 4208095 (Why is no real title available?)
| 1990-01-01 | Paper |
A Construction of Uniquely C4-free colourable Graphs
Quaestiones Mathematicae | 1990-01-01 | Paper |
A note onKi-perfect graphs
Journal of Graph Theory | 1990-01-01 | Paper |
A Set System Polynomial with Colouring and Reliability Applications
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
On generalized graph colorings
Journal of Graph Theory | 1987-01-01 | Paper |
scientific article; zbMATH DE number 4053686 (Why is no real title available?)
| 1987-01-01 | Paper |
