Geodesic

Sommaire du Fascicule no. 1

Krausz dimension and its generalizations in special graph classes
A chip-firing variation and a new proof of Cayley's formula
Isomorphism of graph classes related to the circular-ones property
Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration
Further results on maximal nontraceable graphs of smallest size
The Erdős-Sós conjecture for geometric graphs
List edge and list total colorings of planar graphs without non-induced 7-cycles
All totally symmetric colored graphs
The b-chromatic number of powers of cycles
Automaticity of primitive words and irreducible polynomials
A bound on the number of perfect matchings in Klee-graphs
The determining number of Kneser graphs
Sequence variations of the 1-2-3 conjecture and irregularity strength
A generic method for the enumeration of various classes of directed polycubes

Sommaire du Fascicule no. 2

Descent variation of samples of geometric random variables
Operations on partially ordered sets and rational identities of type A
The complexity of 2-coloring and strong coloring in uniform hypergraphs of high minimum degree
Efficient repeat finding in sets of strings via suffix arrays
Derivatives of approximate regular expressions
A stronger recognizability condition for two-dimensional languages
Removable edges in near-bricks
Topological structuring of the digital plane
Probe interval graphs and probe unit interval graphs on superclasses of cographs
On-line ranking of split graphs
Cyclic partitions of complete nonuniform hypergraphs and complete multipartite hypergraphs
A note on contracting claw-free graphs
A note on the NP-hardness of two matching problems in induced subgrids
Maximal independent sets in bipartite graphs with at least one cycle
Coupon collecting and transversals of hypergraphs
Bipartite powers of k-chordal graphs
Connectivity for line-of-sight networks in higher dimensions
Improved bounds on the crossing number of butterfly network
On the enumeration of d-minimal permutations

Sommaire du Fascicule no. 3

Homomorphisms of planar signed graphs to signed projective cubes
On the connectedness and diameter of a geometric Johnson graph
1-local 33/24-competitive Algorithm for Multicoloring Hexagonal Graphs
The resolving number of a graph Delia
Clique cycle transversals in graphs with few P₄'s
A new characterization and a recognition algorithm of Lucas cubes
Surjective cellular automata far from the Garden of Eden
The Cerný conjecture for automata respecting intervals of a directed graph
Two player game variant of the Erd\H os-Szekeres problem
The Magnus-Derek game in groups
On the complexity of distributed BFS in ad hoc networks with non-spontaneous wake-ups
Coloring and Guarding Arrangements