Recenzie
К проблеме однозначности кодирования
A note on one-sided context-sensitive grammars
Domination in -cubes with diagonals
Za Jaroslavem Morávkem
On Hamiltonian circuits and spanning trees of hypercubes
On the completeness-number of a finite graph
On the completeness-number of a finite graph. II.
On 2-periodic graphs of a certain graph operator
We deal with the graph operator defined to be the complement of the square of a graph: . Motivated by one of many open problems formulated in [6] we look for graphs that are 2-periodic with respect to this operator. We describe a class of bipartite graphs possessing the above mentioned property and prove that for any m,n ≥ 6, the complete bipartite graph can be decomposed in two edge-disjoint factors from . We further show that all the incidence graphs of Desarguesian finite projective geometries...
-valuations of graphs
On maximal matchings in and a conjecture of R. Forcade
Zprávy. K šedesátinám člena korespondenta ČSAV Miroslava Fiedlera
Embedding the polytomic tree into the -cube
O vnoření dichotomického stromu do krychle
GUHA - metoda systematického vyhledávání hypotéz. II
GUHA - metoda systematického vyhledávání hypotéz
On edge domatic number of hypercubes
O desátém Hilbertově problému
Finite branching automata
The theory of regular events. II
Page 1 Next