Geodesic

Sommaire du Fascicule no. 1

Computation with No Memory, and Rearrangeable Multicast Networks
List circular backbone colouring
Strong parity vertex coloring of plane graphs
Canonical forms for free κ-semigroups
Computing the number of h-edge spanning forests in complete bipartite graphs
An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n+1) - p(n) ≤ 2
A combinatorial non-commutative Hopf algebra of graphs
Descents after maxima in compositions
Congruence successions in compositions
Graphs where every k-subset of vertices is an identifying set
The Price of Mediation
A Parameterized Measure-and-ConquerAnalysis for Finding a k-Leaf Spanning Treein an Undirected Graph
List circular backbone colouring
On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph
A variant of Niessen’s problem on degreesequences of graphs
On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs
The Price of Connectivity for Vertex Cover
The total irregularity of a graph
On the Meyniel condition for hamiltonicity in bipartite digraphs
On size, radius and minimum degree
The generalized 3-connectivity of Lexicographic product graphs
Efficient open domination in graph products
Strong parity vertex coloring of plane graphs
Elements in finite classical groups whose powers have large 1-Eigenspaces
Robot's hand and expansions in non-integer bases

Sommaire du Fascicule no. 2

Uniquely monopolar-partitionable block graphs
On additive combinatorics of permutations of ℤn
Complexity aspects of the computation of the rank of a graph
The graph isomorphism problem on geometric graphs
Nonrepetitive colorings of lexicographic product of graphs
A matroid associated with a phylogenetic tree
Hamiltonian decomposition of prisms over cubic graphs
Diversities and the Geometry of Hypergraphs
Influence of the tie-break rule on the end-vertex problem
Spanning connectedness and Hamiltonian thickness of graphs and interval graphs

Sommaire du Fascicule no. 3

Partitioning Harary graphs into connected subgraphs containing prescribed vertices
Detection number of bipartite graphs and cubic graphs
Generalized dynamic storage allocation
Toppling numbers of complete and random graphs
On the number of regular edge labelings
An algorithmic analysis of Flood-It and Free-Flood-It on graph powers
On the numbers of radial orderings of planar point sets
Cell-paths in mono- and bichromatic line arrangements in the plane
Determining pure discrete spectrum for some self-affine tilings
Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
Packing and covering the balanced complete bipartite multigraph with cycles and stars
Complexity of conditional colouring with given template
Oriented diameter and rainbow connection number of a graph
A four-sweep LBFS recognition algorithm for interval graphs
An exact algorithm for the generalized list T-coloring problem
On permutation complexity of fixed points of some uniform binary morphisms
Bounding the monomial index and (1,l)-weight choosability of a graph
Biased weak polyform achievement games
Genus distributions of cubic series-parallel graphs
Balancedness of subclasses of circular-arc graphs