Geodesic

Sommaire du Fascicule no. 1

A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set
The Join of the Varieties of R-trivial and L-trivial Monoids via Combinatorics on Words
Monadic Second-Order Classes of Forests with a Monadic Second-Order 0-1 Law
Bounds for the minimum oriented diameter
A linear time algorithm for finding an Euler walk in a strongly connected 3-uniform hypergraph
alpha-Labelings and the Structure of Trees with Nonzero alpha-Deficit
Vertex-colouring edge-weightings with two edge weights
On hamiltonian chain saturated uniform hypergraphs
The generalized 3-connectivity of Cartesian product graphs
Optimal Computer Crash Performance Precaution
Adaptive Identification of Sets of Vertices in Graphs

Sommaire du Fascicule no. 2

On the algebraic numbers computable by some generalized Ehrenfest urns
The competition number of a generalized line graph is at most two
On bipartite powers of bigraphs
On neighbour-distinguishing colourings from lists
Random Horn formulas and propagation connectivity for directed hypergraphs
Some results on stable sets for k-colorable P₆-free graphs and generalizations
The asymmetric leader election algorithm with Swedish stopping: a probabilistic analysis
The analysis of find and versions of it
On 4-valent Frobenius circulant graphs
Digraph complexity measures and applications in formal language theory
A note on planar Ramsey numbers for a triangle versus wheels
Secure frameproof codes through biclique covers
On paths, trails and closed trails in edge-colored graphs
Graphs with many vertex-disjoint cycles
Random Cayley digraphs of diameter 2 and given degree
Immersion containment and connectivity in color-critical graphs
Acyclic chromatic index of fully subdivided graphs and Halin graphs
On quadratic threshold CSPs
Random graphs with bounded maximum degree: asymptotic structure and a logical limit law
Upper k-tuple domination in graphs