Geodesic

Volume 21 (2019) no. 3

Sommaire

Solving Two Conjectures regarding Codes for Location in Circulant Graphs
Binding Number, Toughness and General Matching Extendability in Graphs
On the maximum number of minimum total dominating sets in forests
$K_{1,3}$-covering red and blue points in the plane
Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words
On the insertion of n-powers
Packing coloring of generalized Sierpinski graphs
Packing chromatic vertex-critical graphs
Slimness of graphs
Bounds for the smallest $k$-chromatic graphs of given girth
Some results on the palette index of graphs
Exact values for three domination-like problems in circular and infinite grid graphs of small height
Number of orbits of Discrete Interval Exchanges
The agreement distance of rooted phylogenetic networks
Non-crossing paths with geographic constraints
Consecutive patterns in restricted permutations and involutions
Planar 3-SAT with a Clause/Variable Cycle
Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models
Efficient enumeration of solutions produced by closure operations
On-line algorithms for multiplication and division in real and complex numeration systems
On the multipacking number of grid graphs
The Adaptive sampling revisited
Backbone colouring and algorithms for TDMA scheduling
Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles