Geodesic

Sommaire

Polynomial algorithm for the path facility location problem with uniform capacities
p. 3-18
On the entropy minimal hereditary classes of coloured graphs
p. 19-25
Acyclic 3-choosability of plane graphs without cycles of length from~4 to~12
p. 26-33
On one twocriterial graph problem
p. 34-40
Continued sets of boundary classes of graphs for colorability problems
p. 41-51
On nonexistence of some perfect 2-colorings of Johnson graphs
p. 52-68
Lower bound for the computation complexity of BCH-codes for branching programs
p. 69-77
On the complexity of generalized contact circuits
p. 78-87