Geodesic

Sommaire

Half-chromatic number of graph
p. 3-11
Some polynomially solvable cases and approximation algorithms for optimal communication tree construction problem
p. 12-27
Perfect 3-colorings of prisms and M\"obius ladders
p. 28-36
A new attainable lower bound on the number of nodes in quadruple circulant networks
p. 37-44
On optimal cycles for regular balanced no-wait robotic cell problems
p. 45-57
Majorants and minorants in the graph class with given number of vertices and diameter
p. 58-76
Essential dependence of the Kasami bent functions on the products of variables
p. 77-92
The smallest k-enclosing ball problem
p. 93-99