Geodesic

Sommaire

A~polynomial algorithm for finding the largest independent sets in claw-free graphs
p. 3-19
Acyclic coloring of 1-planar graphs
p. 20-35
On the connected coloring of graphs in prescribed colors
p. 36-43
On a~lower bound for the number of perfect binary codes
p. 44-48
A~survey of methods for the undistorted coding of discrete sources
p. 49-91
On graphs of subwords of DOL-sequences
p. 92-103
Maximization of a~linear objective function by a~greedy algorithm
p. 104-120
New books for discrete mathematics
p. 123-124