Parcourir par

  • Revues
  • Séminaires
  • Livres
  • Congrès
  • Sources

Geodesic


    Parcourir par

    • Revues
    • Séminaires
    • Livres
    • Congrès
    • Sources
Diskretnyj analiz i issledovanie operacij
Tome 8 (2001)
no. 4
Précédent Suivant

Sommaire


Perfect codes of complete rank with kernels of large dimensions
S. V. Avgustinovich ; F. I. Solov'eva ; O. Heden
p. 3-8

Minimal degrees and chromatic numbers of squares of planar graphs
O. V. Borodin ; H. Broersma ; A. N. Glebov ; J. van den Heuvel
p. 9-33

On the partition of a~planar graph of girth~5 into an empty and an acyclic subgraph
O. V. Borodin ; A. N. Glebov
p. 34-53

For what~k in almost every n-vertex graph do there exist all nonisomorphic k-vertex subgraphs?
A. D. Korshunov
p. 54-67

Positive BE-representations of dictionary predicates
S. S. Marchenkov
p. 68-75

On a~method for obtaining lower bounds for the complexity of the realization of Boolean functions by nondeterministic branching programs
E. A. Okolnishnikova
p. 76-102

On the complexity of realization of powers of Boolean functions by formulas
D. Yu. Cherukhin
p. 103-111

New books for discrete mathematics
A. D. Korshunov
p. 114-116