Lucas Mol

48 papers Journal 45Unranked 3
YearRankTypeTitle / Venue / Authors
2025 — conf
Avoiding Abelian and Additive Powers in Rich Words.
WORDS
Jonathan Andrade, Lucas Mol
2025 J jnl
The Repetition Threshold for Ternary Rich Words.
Electron. J. Comb.
James D. Currie, Lucas Mol, Jarkko Peltomäki
2024 J jnl
Avoiding abelian and additive powers in rich words.
CoRR
Jonathan Andrade, Lucas Mol
2024 J jnl
Extending Dekking's Construction of an Infinite Binary Word Avoiding Abelian 4-Powers.
SIAM J. Discret. Math.
James D. Currie, Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
2024 J jnl
The repetition threshold for ternary rich words.
CoRR
James D. Currie, Lucas Mol, Jarkko Peltomäki
2023 J jnl
Antisquares and Critical Exponents.
Discret. Math. Theor. Comput. Sci.
Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2023 — conf
Dyck Words, Pattern Avoidance, and Automatic Sequences.
WORDS
Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
2023 J jnl
Dyck Words, Pattern Avoidance, and Automatic Sequences.
CoRR
Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
2023 J jnl
The threshold dimension and irreducible graphs.
Discuss. Math. Graph Theory
Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann
2022 J jnl
Antisquares and Critical Exponents.
CoRR
Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
2022 J jnl
On the average (edge-)connectivity of minimally k-(edge-)connected graphs.
Bull. ICA
Lucas Mol, Ortrud R. Oellermann, Vibhav Oswal
2022 J jnl
The maximum average connectivity among all orientations of a graph.
J. Comb. Optim.
Rocío M. Casablanca, Peter Dankelmann, Wayne Goddard, Lucas Mol, Ortrud Oellermann
2021 J jnl
Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs.
Discret. Appl. Math.
Rocío M. Casablanca, Lucas Mol, Ortrud R. Oellermann
2021 J jnl
Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers.
CoRR
James D. Currie, Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
2021 J jnl
Lengths of extremal square-free ternary words.
Contributions Discret. Math.
Lucas Mol, Narad Rampersad
2021 J jnl
Network reliability: Heading out on the highway.
Networks
Jason I. Brown, Charles J. Colbourn, Danielle Cox, Christina Graves, Lucas Mol
2021 J jnl
On the Average (Edge-)Connectivity of Minimally k-(Edge-)Connected Graphs.
CoRR
Lucas Mol, Ortrud R. Oellermann, Vibhav Oswal
2021 J jnl
On the mean subtree order of graphs under edge addition.
J. Graph Theory
Ben Cameron, Lucas Mol
2021 J jnl
The undirected repetition threshold and undirected pattern avoidance.
Theor. Comput. Sci.
James D. Currie, Lucas Mol
2020 J jnl
Extremal Overlap-Free and Extremal $\beta$-Free Binary Words.
Electron. J. Comb.
Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
2020 J jnl
Extremal overlap-free and extremal β-free binary words.
CoRR
Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
2020 J jnl
Lengths of extremal square-free ternary words.
CoRR
Lucas Mol, Narad Rampersad
2020 J jnl
On the mean order of connected induced subgraphs of block graphs.
Australas. J Comb.
Kristaps J. Balodis, Lucas Mol, Ortrud R. Oellermann, Matthew E. Kroeker
2020 J jnl
On the roots of the subtree polynomial.
Eur. J. Comb.
Jason I. Brown, Lucas Mol
2020 J jnl
The Number of Threshold Words on n Letters Grows Exponentially for Every n ≥ 27.
J. Integer Seq.
James D. Currie, Lucas Mol, Narad Rampersad
2020 J jnl
The Threshold Dimension and Irreducible Graphs.
CoRR
Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann
2020 J jnl
The repetition threshold for binary rich words.
Discret. Math. Theor. Comput. Sci.
James D. Currie, Lucas Mol, Narad Rampersad
2020 J jnl
The threshold dimension of a graph.
Discret. Appl. Math.
Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann
2020 J jnl
The undirected repetition threshold and undirected pattern avoidance.
CoRR
James D. Currie, Lucas Mol
2020 J jnl
The weak circular repetition threshold over large alphabets.
RAIRO Theor. Informatics Appl.
Lucas Mol, Narad Rampersad
2019 J jnl
Circular Repetition Thresholds on Some Small Alphabets: Last Cases of Gorbunova's Conjecture.
Electron. J. Comb.
James D. Currie, Lucas Mol, Narad Rampersad
2019 J jnl
Cobham's Theorem and Automaticity.
Int. J. Found. Comput. Sci.
Lucas Mol, Narad Rampersad, Jeffrey O. Shallit, Manon Stipulanti
2019 J jnl
Maximizing the mean subtree order.
J. Graph Theory
Lucas Mol, Ortrud R. Oellermann
2019 J jnl
The Number of Threshold Words on n Letters Grows Exponentially for Every n≥27.
CoRR
James D. Currie, Lucas Mol, Narad Rampersad
2019 — conf
The Undirected Repetition Threshold.
WORDS
James D. Currie, Lucas Mol
2019 J jnl
The Weak Circular Repetition Threshold Over Large Alphabets.
CoRR
Lucas Mol, Narad Rampersad
2019 J jnl
The repetition threshold for binary rich words.
CoRR
James D. Currie, Lucas Mol, Narad Rampersad
2019 J jnl
The undirected repetition threshold.
CoRR
James D. Currie, Lucas Mol
2018 J jnl
Avoidance bases for formulas with reversal.
Theor. Comput. Sci.
James D. Currie, Lucas Mol, Narad Rampersad
2018 J jnl
Circular repetition thresholds on some small alphabets: Last cases of Gorbunova's conjecture.
CoRR
James D. Currie, Lucas Mol, Narad Rampersad
2018 J jnl
Cobham's Theorem and Automaticity.
CoRR
Lucas Mol, Narad Rampersad, Jeffrey O. Shallit, Manon Stipulanti
2018 J jnl
On the mean connected induced subgraph order of cographs.
Australas. J Comb.
Matthew E. Kroeker, Lucas Mol, Ortrud R. Oellermann
2018 J jnl
On the roots of Wiener polynomials of graphs.
Discret. Math.
Jason I. Brown, Lucas Mol, Ortrud R. Oellermann
2018 J jnl
The shape of node reliability.
Discret. Appl. Math.
Jason I. Brown, Lucas Mol
2017 J jnl
A family of formulas with reversal of high avoidability index.
Int. J. Algebra Comput.
James D. Currie, Lucas Mol, Narad Rampersad
2017 J jnl
On avoidability of formulas with reversal.
RAIRO Theor. Informatics Appl.
James D. Currie, Lucas Mol, Narad Rampersad
2017 J jnl
On the roots of all-terminal reliability polynomials.
Discret. Math.
Jason I. Brown, Lucas Mol
2016 J jnl
On the roots of the node reliability polynomial.
Networks
Jason I. Brown, Lucas Mol