On the set of all shortest paths of a given length in a connected graph
Ladislav Nebeský (1996)
Czechoslovak Mathematical Journal
Similarity:
Displaying similar documents to “Visibilities and sets of shortest paths in a connected graph”
On the set of all shortest paths of a given length in a connected graph
Attempts at axiomatic description of conditional independence
Milan Studený (1989)
Kybernetika
Similarity:
General exchange economy
Tran Quoc Chien (1983)
Kybernetika
Similarity: