Characterization of some extremal graphs with diameter no greater than three

Articles in the same Issue

1. On the complexity and depth of circuits that realize partial Boolean functions
2. On some properties of algebras with simple multiplication containing associative subalgebras
3. On the structure of the lattice of closed classes of polynomials
4. Codes and designs
5. On the minimal packing of a tree with fixed vertices
6. Characterization of some extremal graphs with diameter no greater than three
7. On the traversal of labyrinths by automata leaving unremovable labels
8. Approximate models of permutational automata
9. Limit theorems for the number of empty cells
10. Fourth Petrozavodsk Conference ‘Probabilistic Methods in Discrete Mathematics’