Get started
Author

Lucas Mol

Observed name: Mol, Lucas
ORCID: 0000-0002-4295-0632
Observed ORCID: 0000-0002-4295-0632
OpenAlex ID: A5017514528
Network reliability: Heading out on the highway
2020 · Jason I. Brown, Charles J. Colbourn, et al. · Networks · 40
On the roots of all-terminal reliability polynomials
2017 · Jason Brown, Lucas Mol · Discrete Mathematics · 36
Maximizing the mean subtree order
2018 · Lucas Mol, Ortrud R. Oellermann · Journal of Graph Theory · 28
PDF
The repetition threshold for binary rich words
2020 · James D. Currie, Lucas Mol, et al. · Discrete Mathematics & Theoretical Computer Science · 18
PDF
On the mean subtree order of graphs under edge addition
2020 · Ben Cameron, Lucas Mol · Journal of Graph Theory · 15
PDF
On the Mean Connected Induced Subgraph Order of Cographs
2017 · Kroeker, Matthew E., Mol, Lucas, et al. · arXiv (Cornell University) · 11
PDF
Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs
2021 · Moreno Casablanca, Rocío, Mol, Lucas, et al. · idUS (Universidad de Sevilla) · 10
On the Mean Order of Connected Induced Subgraphs of Block Graphs
2018 · Balodis, Kristaps J., Kroeker, Matthew E., et al. · arXiv (Cornell University) · 10
PDF
The threshold dimension of a graph
2020 · Lucas Mol, Matthew J.H. Murphy, et al. · Discrete Applied Mathematics · 9
A family of formulas with reversal of high avoidability index
2017 · James Currie, Lucas Mol, et al. · International Journal of Algebra and Computation · 8
PDF
Lengths of extremal square-free ternary words
2020 · Mol, Lucas, Rampersad, Narad · Libraries and Cultural Resources (University of Calgary) · 7
On the roots of Wiener polynomials of graphs
2018 · Jason I. Brown, Lucas Mol, et al. · Discrete Mathematics · 7
PDF
The undirected repetition threshold and undirected pattern avoidance
2021 · James D. Currie, Lucas Mol · Theoretical Computer Science · 6
On the roots of the node reliability polynomial
2016 · Jason Brown, Lucas Mol · Networks · 6
PDF
Avoidance bases for formulas with reversal
2018 · James D. Currie, Lucas Mol, et al. · Theoretical Computer Science · 5
PDF
On Connectedness and Graph Polynomials
2016 · Lucas Mol · DalSpace (Dalhousie University) · 5
Lengths of extremal square-free ternary words
2021 · Lucas Mol, Narad Rampersad · Contributions to Discrete Mathematics · 3
PDF
The maximum average connectivity among all orientations of a graph
2021 · Moreno Casablanca, Rocío, Dankelmann, Peter, et al. · Deposito de Investigacion Universidad de Sevilla (University of Seville) · 3
Extremal Overlap-Free and Extremal $\beta$-Free Binary Words
2020 · Lucas Mol, Narad Rampersad, et al. · The Electronic Journal of Combinatorics · 3
PDF
Circular Repetition Thresholds on Some Small Alphabets: Last Cases of Gorbunova's Conjecture
2019 · James D. Currie, Lucas Mol, et al. · The Electronic Journal of Combinatorics · 3
PDF
The shape of node reliability
2018 · Jason I. Brown, Lucas Mol · Discrete Applied Mathematics · 3
PDF
The Repetition Threshold for Ternary Rich Words
2025 · James Currie, Lucas Mol, et al. · The Electronic Journal of Combinatorics · 2
PDF
Extending Dekking’s Construction of an Infinite Binary Word Avoiding Abelian 4-Powers
2024 · James Currie, Lucas Mol, et al. · SIAM Journal on Discrete Mathematics · 2
PDF
Dyck Words, Pattern Avoidance, and Automatic Sequences
2023 · Lucas Mol, Narad Rampersad, et al. · Lecture notes in computer science · 2
The maximum average connectivity among all orientations of a graph
2021 · Rocío M. Casablanca, Peter Dankelmann, et al. · Journal of Combinatorial Optimization · 2
PDF
Works count: 42
Citation count: 256
H-index: 9
I10-index: 8
Year
Topic
Type