Extending Dekking's Construction of an Infinite Binary Word Avoiding Abelian 4-Powers.

The repetition threshold for ternary rich words.

Avoiding abelian and additive powers in rich words.

Antisquares and Critical Exponents.

The threshold dimension and irreducible graphs.

The maximum average connectivity among all orientations of a graph.

On the average (edge-)connectivity of minimally k-(edge-)connected graphs.

The undirected repetition threshold and undirected pattern avoidance.

Network reliability: Heading out on the highway.

On the mean subtree order of graphs under edge addition.

Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs.

Lengths of extremal square-free ternary words.

The Number of Threshold Words on n Letters Grows Exponentially for Every n ≥ 27.

The weak circular repetition threshold over large alphabets.

On the roots of the subtree polynomial.

The repetition threshold for binary rich words.

The threshold dimension of a graph.

Extremal overlap-free and extremal β-free binary words.

Extremal Overlap-Free and Extremal $\beta$-Free Binary Words.

On the mean order of connected induced subgraphs of block graphs.

Maximizing the mean subtree order.

Cobham's Theorem and Automaticity.

Circular Repetition Thresholds on Some Small Alphabets: Last Cases of Gorbunova's Conjecture.

Avoidance bases for formulas with reversal.

On the roots of Wiener polynomials of graphs.

The shape of node reliability.

On the mean connected induced subgraph order of cographs.

On avoidability of formulas with reversal.

A family of formulas with reversal of high avoidability index.

On the roots of all-terminal reliability polynomials.

On the roots of the node reliability polynomial.