Finding a spanning tree of a graph with maximal number of terminal vertices. - Bohdan Zelinka (Kybernetika, 1973)

Determining the maximal degree of a tree given by its distance matrix. - Bohdan Zelinka (Kybernetika, 1973)

Strongly connected digraphs in which each edge is contained in exactly two cycles. - Bohdan Zelinka (Acta Cybern., 1979)

On a problem of a. kotzig concerning factorizations of 4-regular graphs. - Bohdan Zelinka (J. Graph Theory, 1984)

Regular totally domatically full graphs. - Bohdan Zelinka (Discret. Math., 1990)

Some remarks on domination in cubic graphs. - Bohdan Zelinka (Discret. Math., 1996)

Hymn teorii grafów. - Mariusz Meszka; Joanna Nowak; Zdenek Ryjácek; Bohdan Zelinka (Discuss. Math. Graph Theory, 1996)

On the simplex graph operator. - Bohdan Zelinka (Discuss. Math. Graph Theory, 1998)

Graphs maximal with respect to absence of hamiltonian paths. - Bohdan Zelinka (Discuss. Math. Graph Theory, 1998)

A note on periodicity of the 2-distance operator. - Bohdan Zelinka (Discuss. Math. Graph Theory, 2000)

Periodicity of graph operators. - Bohdan Zelinka (Discret. Math., 2001)

On 2-periodic graphs of a certain graph operator. - Ivan Havel; Bohdan Zelinka (Discuss. Math. Graph Theory, 2001)

Signed domatic number of a graph. - Lutz Volkmann; Bohdan Zelinka (Discret. Appl. Math., 2005)