Lucas Mol

Publication Activity (10 Years)

Years Active: 2016-2023
Publications (10 Years): 42

Top Topics

Connected Graphs

Threshold Selection

Thresholding Method

Top Venues

Discret. Appl. Math.

J. Graph Theory

Theor. Comput. Sci.

Publications

Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann
The threshold dimension and irreducible graphs. Discuss. Math. Graph Theory 43 (1) (2023)
Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
Dyck Words, Pattern Avoidance, and Automatic Sequences. WORDS (2023)
Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
Dyck Words, Pattern Avoidance, and Automatic Sequences. CoRR (2023)
Rocío M. Casablanca, Peter Dankelmann, Wayne Goddard, Lucas Mol, Ortrud Oellermann
The maximum average connectivity among all orientations of a graph. J. Comb. Optim. 43 (3) (2022)
Lucas Mol, Ortrud R. Oellermann, Vibhav Oswal
On the average (edge-)connectivity of minimally k-(edge-)connected graphs. Bull. ICA 94 (2022)
Aseem R. Baranwal, James D. Currie, Lucas Mol, Pascal Ochem, Narad Rampersad, Jeffrey O. Shallit
Antisquares and Critical Exponents. CoRR (2022)
Lucas Mol, Narad Rampersad
Lengths of extremal square-free ternary words. Contributions Discret. Math. 16 (1) (2021)
Jason I. Brown, Charles J. Colbourn, Danielle Cox, Christina Graves, Lucas Mol
Network reliability: Heading out on the highway. Networks 77 (1) (2021)
Rocío M. Casablanca, Lucas Mol, Ortrud R. Oellermann
Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs. Discret. Appl. Math. 289 (2021)
James D. Currie, Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
Extending Dekking's construction of an infinite binary word avoiding abelian 4-powers. CoRR (2021)
James D. Currie, Lucas Mol
The undirected repetition threshold and undirected pattern avoidance. Theor. Comput. Sci. 866 (2021)
Lucas Mol, Ortrud R. Oellermann, Vibhav Oswal
On the Average (Edge-)Connectivity of Minimally k-(Edge-)Connected Graphs. CoRR (2021)
Ben Cameron, Lucas Mol
On the mean subtree order of graphs under edge addition. J. Graph Theory 96 (3) (2021)
James D. Currie, Lucas Mol, Narad Rampersad
The repetition threshold for binary rich words. Discret. Math. Theor. Comput. Sci. 22 (1) (2020)
James D. Currie, Lucas Mol
The undirected repetition threshold and undirected pattern avoidance. CoRR (2020)
Jason I. Brown, Lucas Mol
On the roots of the subtree polynomial. Eur. J. Comb. 89 (2020)
Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann
The threshold dimension of a graph. Discret. Appl. Math. 287 (2020)
Kristaps J. Balodis, Lucas Mol, Ortrud R. Oellermann, Matthew E. Kroeker
On the mean order of connected induced subgraphs of block graphs. Australas. J Comb. 76 (2020)
Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
Extremal overlap-free and extremal β-free binary words. CoRR (2020)
Lucas Mol, Narad Rampersad, Jeffrey O. Shallit
Extremal Overlap-Free and Extremal $\beta$-Free Binary Words. Electron. J. Comb. 27 (4) (2020)
Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann
The Threshold Dimension and Irreducible Graphs. CoRR (2020)
Lucas Mol, Narad Rampersad
The weak circular repetition threshold over large alphabets. RAIRO Theor. Informatics Appl. 54 (2020)
James D. Currie, Lucas Mol, Narad Rampersad
The Number of Threshold Words on n Letters Grows Exponentially for Every n ≥ 27. J. Integer Seq. 23 (3) (2020)
Lucas Mol, Narad Rampersad
Lengths of extremal square-free ternary words. CoRR (2020)
Lucas Mol, Narad Rampersad, Jeffrey O. Shallit, Manon Stipulanti
Cobham's Theorem and Automaticity. Int. J. Found. Comput. Sci. 30 (8) (2019)
James D. Currie, Lucas Mol
The Undirected Repetition Threshold. WORDS (2019)
James D. Currie, Lucas Mol, Narad Rampersad
Circular Repetition Thresholds on Some Small Alphabets: Last Cases of Gorbunova's Conjecture. Electron. J. Comb. 26 (2) (2019)
James D. Currie, Lucas Mol, Narad Rampersad
The repetition threshold for binary rich words. CoRR (2019)
Lucas Mol, Ortrud R. Oellermann
Maximizing the mean subtree order. J. Graph Theory 91 (4) (2019)
Lucas Mol, Narad Rampersad
The Weak Circular Repetition Threshold Over Large Alphabets. CoRR (2019)
James D. Currie, Lucas Mol
The undirected repetition threshold. CoRR (2019)
James D. Currie, Lucas Mol, Narad Rampersad
The Number of Threshold Words on n Letters Grows Exponentially for Every n≥27. CoRR (2019)
Lucas Mol, Narad Rampersad, Jeffrey O. Shallit, Manon Stipulanti
Cobham's Theorem and Automaticity. CoRR (2018)
James D. Currie, Lucas Mol, Narad Rampersad
Avoidance bases for formulas with reversal. Theor. Comput. Sci. 738 (2018)
Jason I. Brown, Lucas Mol
The shape of node reliability. Discret. Appl. Math. 238 (2018)
Matthew E. Kroeker, Lucas Mol, Ortrud R. Oellermann
On the mean connected induced subgraph order of cographs. Australas. J Comb. 71 (2018)
James D. Currie, Lucas Mol, Narad Rampersad
Circular repetition thresholds on some small alphabets: Last cases of Gorbunova's conjecture. CoRR (2018)
Jason I. Brown, Lucas Mol, Ortrud R. Oellermann
On the roots of Wiener polynomials of graphs. Discret. Math. 341 (9) (2018)
James D. Currie, Lucas Mol, Narad Rampersad
On avoidability of formulas with reversal. RAIRO Theor. Informatics Appl. 51 (4) (2017)
James D. Currie, Lucas Mol, Narad Rampersad
A family of formulas with reversal of high avoidability index. Int. J. Algebra Comput. 27 (5) (2017)
Jason I. Brown, Lucas Mol
On the roots of all-terminal reliability polynomials. Discret. Math. 340 (6) (2017)
Jason I. Brown, Lucas Mol
On the roots of the node reliability polynomial. Networks 68 (3) (2016)