The following pages link to L. A. S. Mól (Q1413461):
Displaying 35 items.
- (Q724844) (redirect page) (← links)
- On the roots of Wiener polynomials of graphs (Q724845) (← links)
- On phase transition and vortex stability in the generalized \(XY\) models (Q1413462) (← links)
- Avoidance bases for formulas with reversal (Q1643149) (← links)
- Using zeros of the canonical partition function map to detect signatures of a Berezinskii-Kosterlitz-thouless transition (Q1682947) (← links)
- The shape of node reliability (Q1701111) (← links)
- The threshold dimension of a graph (Q2004085) (← links)
- The threshold dimension and irreducible graphs (Q2107754) (← links)
- The maximum average connectivity among all orientations of a graph (Q2125229) (← links)
- On the roots of the subtree polynomial (Q2198997) (← links)
- Extremal overlap-free and extremal \(\beta\)-free binary words (Q2215463) (← links)
- Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs (Q2217476) (← links)
- The fully frustrated XY model revisited: A new universality class (Q2315137) (← links)
- The undirected repetition threshold (Q2333037) (← links)
- On the roots of all-terminal reliability polynomials (Q2400560) (← links)
- Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture (Q2420559) (← links)
- Diluted planar ferromagnets: nonlinear excitations on a non-simply connected manifold (Q2425685) (← links)
- The undirected repetition threshold and undirected pattern avoidance (Q2662683) (← links)
- On the Mean Connected Induced Subgraph Order of Cographs (Q4616101) (← links)
- On avoidability of formulas with reversal (Q4638263) (← links)
- On the roots of the node reliability polynomial (Q4639686) (← links)
- Lengths of extremal square-free ternary words. (Q4986268) (← links)
- The weak circular repetition threshold over large alphabets (Q5021102) (← links)
- On the Average (Edge-)Connectivity of Minimally $k$-(Edge-)Connected Graphs (Q5032440) (← links)
- On the Mean Order of Connected Induced Subgraphs of Block Graphs (Q5109058) (← links)
- The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ (Q5109538) (← links)
- The repetition threshold for binary rich words (Q5130737) (← links)
- Cobham’s Theorem and Automaticity (Q5207238) (← links)
- Maximizing the mean subtree order (Q5229538) (← links)
- A family of formulas with reversal of high avoidability index (Q5365323) (← links)
- On the mean subtree order of graphs under edge addition (Q6055400) (← links)
- Network reliability: Heading out on the highway (Q6087070) (← links)
- Dyck Words, Pattern Avoidance, and Automatic Sequences (Q6134876) (← links)
- The Weak Circular Repetition Threshold Over Large Alphabets (Q6331767) (← links)
- Extending Dekking's construction of an infinite binary word avoiding abelian $4$-powers (Q6383093) (← links)