Lucas Mol

Jarkko Peltomäki

CoRR, 2024

Avoiding abelian and additive powers in rich words.

[BibT_eX]

[DOI]

Jonathan Andrade

CoRR, 2024

2023

The threshold dimension and irreducible graphs.

[BibT_eX]

[DOI]

Matthew J. H. Murphy

Discuss. Math. Graph Theory, 2023

Dyck Words, Pattern Avoidance, and Automatic Sequences.

[BibT_eX]

[DOI]

Jeffrey O. Shallit

Proceedings of the Combinatorics on Words - 14th International Conference, 2023

2022

The maximum average connectivity among all orientations of a graph.

[BibT_eX]

[DOI]

J. Comb. Optim., 2022

Antisquares and Critical Exponents.

[BibT_eX]

[DOI]

CoRR, 2022

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

[BibT_eX]

[DOI]

Vibhav Oswal

Bull. ICA, 2022

2021

The undirected repetition threshold and undirected pattern avoidance.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Network reliability: Heading out on the highway.

[BibT_eX]

[DOI]

Networks, 2021

On the mean subtree order of graphs under edge addition.

[BibT_eX]

[DOI]

Ben Cameron

J. Graph Theory, 2021

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

[BibT_eX]

[DOI]

Rocío M. Casablanca

Discret. Appl. Math., 2021

Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers.

[BibT_eX]

[DOI]

CoRR, 2021

Lengths of extremal square-free ternary words.

[BibT_eX]

[DOI]

Contributions Discret. Math., 2021

2020

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

[BibT_eX]

[DOI]

J. Integer Seq., 2020

The weak circular repetition threshold over large alphabets.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2020

On the roots of the subtree polynomial.

[BibT_eX]

[DOI]

Eur. J. Comb., 2020

The repetition threshold for binary rich words.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2020

The threshold dimension of a graph.

[BibT_eX]

[DOI]

Matthew J. H. Murphy

Discret. Appl. Math., 2020

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

[BibT_eX]

[DOI]

Jeffrey O. Shallit

CoRR, 2020

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

[BibT_eX]

[DOI]

Jeffrey O. Shallit

Electron. J. Comb., 2020

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

[BibT_eX]

[DOI]

Australas. J Comb., 2020

2019

Maximizing the mean subtree order.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

Cobham's Theorem and Automaticity.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2019

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

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

The Undirected Repetition Threshold.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 12th International Conference, 2019

2018

Avoidance bases for formulas with reversal.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

On the roots of Wiener polynomials of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

The shape of node reliability.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

On the mean connected induced subgraph order of cographs.

[BibT_eX]

[DOI]

Matthew E. Kroeker

Australas. J Comb., 2018

2017

On avoidability of formulas with reversal.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2017

A family of formulas with reversal of high avoidability index.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2017

On the roots of all-terminal reliability polynomials.

[BibT_eX]

[DOI]

Discret. Math., 2017

2016

On the roots of the node reliability polynomial.

[BibT_eX]

[DOI]