Geodesic

Volume 16 (2014) no. 1

Sommaire

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