Geodesic

Sommaire

A family of two-dimensional words with maximal pattern complexity~2k
p. 3-14
On reconstruction of binary codes by dimensions of their subcodes
p. 15-21
List 2-distance (Δ+1)-coloring of planar graphs with girth at least~7
p. 22-36
NP-completeness of~some problems of a~vectors subset choice
p. 37-45
Cycles of length seven in the pancake graph
p. 46-55
Multiplicative circulant networks
p. 56-66
A rule for the addition of entropies for underdetermined data
p. 67-90