The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Finding H -partitions efficiently”

Domination in Kneser graphs

Jaroslav Ivančo, Bohdan Zelinka (1993)

Mathematica Bohemica

Similarity:

The domination number and the domatic number of a certain special type of Kneser graphs are determined.