Neighbourhood digraphs
Bohdan Zelinka (1987)
Archivum Mathematicum
Similarity:
Displaying similar documents to “Paths and stability number in digraphs.”
Neighbourhood digraphs
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:
On a graph theory problem of M. Koman
Dragoš M. Cvetković (1973)
Časopis pro pěstování matematiky
Similarity:
Induced complete -partite graphs in dense clique-less graphs.
Fischer, Eldar (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity: