EUDML | On the completeness-number of a finite graph. II.

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “On the completeness-number of a finite graph. II.”

On decompositions of complete graphs into three factors with given diameters

Pavel Hrnčiar (1990)

Czechoslovak Mathematical Journal

Similarity:

Edge neighbourhood graphs

Bohdan Zelinka (1986)

Czechoslovak Mathematical Journal

Similarity:

On graphs with prescribed edge neighbourhoods

Dalibor Fronček (1989)

Commentationes Mathematicae Universitatis Carolinae

Similarity: