Geodesic

Volume 22 (2020-2021) no. 1

Sommaire

From light edges to strong edge-colouring of 1-planar graphs
Vertex order with optimal number of adjacent predecessors
On the Complexity of Digraph Colourings and Vertex Arboricity
A Characterization of Morphic Words with Polynomial Growth
The repetition threshold for binary rich words
Analysis of a Model for Generating Weakly Scale-free Networks
New tools for state complexity
A method for eternally dominating strong grids
The 3-way flower intersection problem for Steiner triple systems
The Chromatic Number of the Disjointness Graph of the Double Chain
The super-connectivity of Johnson graphs
Complexity of Leading Digit Sequences
The minimal probabilistic and quantum finite automata recognizing uncountably many languages with fixed cutpoints
Formal inverses of the generalized Thue-Morse sequences and variations of the Rudin-Shapiro sequence
The Complexity of Helly-$B_{1}$ EPG Graph Recognition
New schemes for simplifying binary constraint satisfaction problems
Complementary symmetric Rote sequences: the critical exponent and the recurrence function
Antifactors of regular bipartite graphs
Inversion sequences avoiding pairs of patterns
On the heapability of finite partial orders
The agreement distance of unrooted phylogenetic networks
Dissecting a square into congruent polygons
On an alternative sequence comparison statistic of Steele