EUDML | Paths and stability number in digraphs.

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

Displaying similar documents to “Paths and stability number in digraphs.”

Neighbourhood digraphs

Bohdan Zelinka (1987)

Archivum Mathematicum

Similarity:

Every connected acyclic digraph of height 1 is neighbourhood-realizable

Bohdan Zelinka (1991)

Archivum Mathematicum

Similarity:

On the existence of critically n-connected graphs

Ferdinand Gliviak (1976)

Mathematica Slovaca

Similarity: